./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrnlen-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 12318f34040209c37cd54fcab38029595d0807d6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:56:50,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:56:50,467 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:56:50,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:56:50,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:56:50,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:56:50,488 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:56:50,491 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:56:50,493 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:56:50,494 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:56:50,495 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:56:50,495 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:56:50,496 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:56:50,497 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:56:50,498 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:56:50,499 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:56:50,500 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:56:50,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:56:50,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:56:50,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:56:50,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:56:50,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:56:50,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:56:50,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:56:50,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:56:50,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:56:50,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:56:50,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:56:50,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:56:50,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:56:50,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:56:50,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:56:50,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:56:50,517 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:56:50,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:56:50,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:56:50,527 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:56:50,545 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:56:50,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:56:50,546 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:56:50,547 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:56:50,547 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:56:50,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:56:50,547 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:56:50,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:56:50,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:56:50,548 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:56:50,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:56:50,548 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:56:50,548 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:56:50,548 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:56:50,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:56:50,549 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:56:50,549 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:56:50,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:56:50,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:56:50,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:56:50,549 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:56:50,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:50,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:56:50,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:56:50,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:56:50,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:56:50,550 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 -> 12318f34040209c37cd54fcab38029595d0807d6 [2019-01-13 21:56:50,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:56:50,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:56:50,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:56:50,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:56:50,607 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:56:50,608 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:50,663 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddbae2c1a/0c5956856946405a916d4972de692656/FLAGff5014c84 [2019-01-13 21:56:51,191 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:56:51,192 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:51,211 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddbae2c1a/0c5956856946405a916d4972de692656/FLAGff5014c84 [2019-01-13 21:56:51,446 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddbae2c1a/0c5956856946405a916d4972de692656 [2019-01-13 21:56:51,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:56:51,452 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:56:51,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:51,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:56:51,460 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:56:51,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:51" (1/1) ... [2019-01-13 21:56:51,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1271ba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:51, skipping insertion in model container [2019-01-13 21:56:51,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:51" (1/1) ... [2019-01-13 21:56:51,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:56:51,524 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:56:51,864 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:51,877 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:56:51,946 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:52,076 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:56:52,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:52 WrapperNode [2019-01-13 21:56:52,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:52,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:56:52,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:56:52,078 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:56:52,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:52" (1/1) ... [2019-01-13 21:56:52,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:52" (1/1) ... [2019-01-13 21:56:52,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:52" (1/1) ... [2019-01-13 21:56:52,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:52" (1/1) ... [2019-01-13 21:56:52,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:52" (1/1) ... [2019-01-13 21:56:52,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:52" (1/1) ... [2019-01-13 21:56:52,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:52" (1/1) ... [2019-01-13 21:56:52,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:56:52,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:56:52,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:56:52,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:56:52,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:52" (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:52,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:56:52,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:56:52,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:56:52,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:56:52,207 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrnlen [2019-01-13 21:56:52,207 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:56:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:56:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:56:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:56:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:56:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:56:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:56:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:56:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:56:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:56:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:56:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:56:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:56:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:56:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:56:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:56:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:56:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:56:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:56:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:56:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:56:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:56:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:56:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:56:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:56:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:56:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:56:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:56:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:56:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:56:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:56:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:56:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:56:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:56:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:56:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:56:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:56:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:56:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:56:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:56:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:56:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:56:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:56:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:56:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:56:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:56:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:56:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:56:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:56:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:56:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:56:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:56:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:56:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:56:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:56:52,215 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:56:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:56:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:56:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:56:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:56:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:56:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:56:52,216 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:56:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:56:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:56:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:56:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:56:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:56:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:56:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:56:52,217 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:56:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:56:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:56:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:56:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:56:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:56:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:56:52,218 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:56:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:56:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:56:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:56:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:56:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:56:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:56:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:56:52,219 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:56:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:56:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:56:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:56:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:56:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:56:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:56:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:56:52,220 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:56:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure cstrnlen [2019-01-13 21:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:56:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:56:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:56:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:56:52,694 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:56:52,694 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-13 21:56:52,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:52 BoogieIcfgContainer [2019-01-13 21:56:52,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:56:52,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:56:52,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:56:52,700 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:56:52,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:56:51" (1/3) ... [2019-01-13 21:56:52,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1535d470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:52, skipping insertion in model container [2019-01-13 21:56:52,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:52" (2/3) ... [2019-01-13 21:56:52,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1535d470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:52, skipping insertion in model container [2019-01-13 21:56:52,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:52" (3/3) ... [2019-01-13 21:56:52,705 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:52,715 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:56:52,726 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-13 21:56:52,743 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-13 21:56:52,769 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:56:52,770 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:56:52,770 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:56:52,771 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:56:52,772 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:56:52,772 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:56:52,772 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:56:52,773 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:56:52,773 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:56:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-13 21:56:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:52,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:52,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:52,803 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1446509525, now seen corresponding path program 1 times [2019-01-13 21:56:52,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:52,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:52,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:52,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:52,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:52,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:52,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:53,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:53,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:53,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:53,014 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-01-13 21:56:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:53,090 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-01-13 21:56:53,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:53,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:56:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:53,105 INFO L225 Difference]: With dead ends: 30 [2019-01-13 21:56:53,105 INFO L226 Difference]: Without dead ends: 27 [2019-01-13 21:56:53,108 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:53,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-13 21:56:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-13 21:56:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-13 21:56:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-01-13 21:56:53,153 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2019-01-13 21:56:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:53,154 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-01-13 21:56:53,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-01-13 21:56:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:53,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:53,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:53,157 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:53,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1446509524, now seen corresponding path program 1 times [2019-01-13 21:56:53,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:53,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:53,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:53,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:53,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:53,371 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-13 21:56:53,373 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:53,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:53,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:53,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:53,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:53,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:53,377 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-01-13 21:56:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:53,434 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-01-13 21:56:53,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:53,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:56:53,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:53,436 INFO L225 Difference]: With dead ends: 26 [2019-01-13 21:56:53,437 INFO L226 Difference]: Without dead ends: 26 [2019-01-13 21:56:53,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:53,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-13 21:56:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-13 21:56:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-13 21:56:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-01-13 21:56:53,443 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2019-01-13 21:56:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:53,443 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-01-13 21:56:53,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-01-13 21:56:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 21:56:53,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:53,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:53,445 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:53,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1365918261, now seen corresponding path program 1 times [2019-01-13 21:56:53,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:53,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:53,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:53,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:53,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:53,569 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:53,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:53,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:53,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:53,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:53,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:53,572 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2019-01-13 21:56:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:53,775 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-13 21:56:53,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:53,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-13 21:56:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:53,777 INFO L225 Difference]: With dead ends: 25 [2019-01-13 21:56:53,777 INFO L226 Difference]: Without dead ends: 25 [2019-01-13 21:56:53,778 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:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-13 21:56:53,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-13 21:56:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-13 21:56:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-01-13 21:56:53,782 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2019-01-13 21:56:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:53,782 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-13 21:56:53,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-01-13 21:56:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 21:56:53,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:53,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:53,784 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:53,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1365918262, now seen corresponding path program 1 times [2019-01-13 21:56:53,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:53,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:53,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:53,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:53,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:53,946 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:53,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:53,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:53,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:53,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:53,948 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 7 states. [2019-01-13 21:56:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:54,081 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-01-13 21:56:54,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:54,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-13 21:56:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:54,091 INFO L225 Difference]: With dead ends: 34 [2019-01-13 21:56:54,091 INFO L226 Difference]: Without dead ends: 34 [2019-01-13 21:56:54,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-13 21:56:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-01-13 21:56:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-13 21:56:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-13 21:56:54,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2019-01-13 21:56:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:54,107 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-13 21:56:54,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-13 21:56:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 21:56:54,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:54,113 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:54,115 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1010346667, now seen corresponding path program 1 times [2019-01-13 21:56:54,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:54,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:54,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:54,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:54,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:54,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:54,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:54,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:54,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:54,233 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-01-13 21:56:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:54,255 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-01-13 21:56:54,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:54,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-13 21:56:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:54,258 INFO L225 Difference]: With dead ends: 29 [2019-01-13 21:56:54,259 INFO L226 Difference]: Without dead ends: 29 [2019-01-13 21:56:54,259 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:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-13 21:56:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-13 21:56:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-13 21:56:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-01-13 21:56:54,267 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2019-01-13 21:56:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:54,267 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-13 21:56:54,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-01-13 21:56:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:54,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:54,269 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:54,269 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:54,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:54,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1203115076, now seen corresponding path program 1 times [2019-01-13 21:56:54,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:54,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:54,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:54,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:54,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:54,435 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:54,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:54,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:54,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:54,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:54,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:54,437 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2019-01-13 21:56:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:54,652 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-01-13 21:56:54,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:54,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-13 21:56:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:54,656 INFO L225 Difference]: With dead ends: 45 [2019-01-13 21:56:54,657 INFO L226 Difference]: Without dead ends: 45 [2019-01-13 21:56:54,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-13 21:56:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2019-01-13 21:56:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-13 21:56:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-13 21:56:54,677 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2019-01-13 21:56:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:54,677 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-13 21:56:54,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-13 21:56:54,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:54,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:54,684 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:54,684 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:54,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:54,685 INFO L82 PathProgramCache]: Analyzing trace with hash 616309062, now seen corresponding path program 1 times [2019-01-13 21:56:54,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:54,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:54,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:54,922 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:54,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:54,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:54,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:54,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:54,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:54,925 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2019-01-13 21:56:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:55,021 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-13 21:56:55,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:55,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-13 21:56:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:55,022 INFO L225 Difference]: With dead ends: 35 [2019-01-13 21:56:55,022 INFO L226 Difference]: Without dead ends: 25 [2019-01-13 21:56:55,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-13 21:56:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-01-13 21:56:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-13 21:56:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-13 21:56:55,026 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2019-01-13 21:56:55,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:55,027 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-13 21:56:55,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:55,027 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-01-13 21:56:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 21:56:55,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:55,028 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:55,028 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1263944974, now seen corresponding path program 1 times [2019-01-13 21:56:55,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:55,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:55,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:55,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:55,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:55,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:55,317 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:55,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:55,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:55,439 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 11 treesize of output 8 [2019-01-13 21:56:55,449 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:55,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:55,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:55,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:55,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-13 21:56:55,599 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 15 treesize of output 11 [2019-01-13 21:56:55,614 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:55,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:55,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:55,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:55,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-01-13 21:56:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:55,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 21:56:55,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2019-01-13 21:56:55,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 21:56:55,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 21:56:55,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:56:55,729 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 12 states. [2019-01-13 21:56:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:56,254 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-13 21:56:56,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 21:56:56,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-01-13 21:56:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:56,256 INFO L225 Difference]: With dead ends: 53 [2019-01-13 21:56:56,256 INFO L226 Difference]: Without dead ends: 22 [2019-01-13 21:56:56,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2019-01-13 21:56:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-13 21:56:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-13 21:56:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-13 21:56:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-13 21:56:56,261 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 21 [2019-01-13 21:56:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:56,261 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-13 21:56:56,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 21:56:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-13 21:56:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 21:56:56,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:56,263 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:56,263 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:56,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:56,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1027035954, now seen corresponding path program 1 times [2019-01-13 21:56:56,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:56,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:56,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:56,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:56,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:56,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:56,597 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:56,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:56,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:56,666 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 6 treesize of output 5 [2019-01-13 21:56:56,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-13 21:56:56,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:56:56,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:56:56,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:56,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-13 21:56:56,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-13 21:56:56,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:56:56,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:56,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:56,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:56,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:46 [2019-01-13 21:56:57,130 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2019-01-13 21:56:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:57,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:57,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-01-13 21:56:57,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-13 21:56:57,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-13 21:56:57,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-01-13 21:56:57,366 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 18 states. [2019-01-13 21:56:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:57,913 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-13 21:56:57,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:56:57,914 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-01-13 21:56:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:57,916 INFO L225 Difference]: With dead ends: 31 [2019-01-13 21:56:57,916 INFO L226 Difference]: Without dead ends: 31 [2019-01-13 21:56:57,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-01-13 21:56:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-13 21:56:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-01-13 21:56:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-13 21:56:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-13 21:56:57,920 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 21 [2019-01-13 21:56:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:57,920 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-13 21:56:57,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-13 21:56:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-13 21:56:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 21:56:57,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:57,922 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:57,922 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2070961574, now seen corresponding path program 2 times [2019-01-13 21:56:57,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:57,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:57,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:57,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:57,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:58,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:58,448 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:58,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:58,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:56:58,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:58,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:58,503 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 6 treesize of output 5 [2019-01-13 21:56:58,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:58,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:58,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 21:56:58,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:56:58,535 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:58,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:58,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:58,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:58,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-01-13 21:56:58,666 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:58,675 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:58,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:58,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:58,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:58,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2019-01-13 21:56:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:58,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:58,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-01-13 21:56:58,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-13 21:56:58,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-13 21:56:58,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-01-13 21:56:58,803 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 18 states. [2019-01-13 21:56:59,319 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2019-01-13 21:56:59,563 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-01-13 21:57:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:00,121 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-13 21:57:00,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 21:57:00,123 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-01-13 21:57:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:00,123 INFO L225 Difference]: With dead ends: 30 [2019-01-13 21:57:00,123 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:57:00,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2019-01-13 21:57:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:57:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:57:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:57:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:57:00,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-01-13 21:57:00,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:00,126 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:57:00,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-13 21:57:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:57:00,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:57:00,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:57:00 BoogieIcfgContainer [2019-01-13 21:57:00,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:57:00,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:57:00,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:57:00,132 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:57:00,133 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:52" (3/4) ... [2019-01-13 21:57:00,136 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:57:00,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:57:00,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:57:00,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrnlen [2019-01-13 21:57:00,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:57:00,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:57:00,147 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-01-13 21:57:00,147 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-13 21:57:00,147 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 21:57:00,194 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:57:00,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:57:00,196 INFO L168 Benchmark]: Toolchain (without parser) took 8744.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 214.2 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:00,197 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:57:00,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 624.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:00,198 INFO L168 Benchmark]: Boogie Preprocessor took 65.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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:00,198 INFO L168 Benchmark]: RCFGBuilder took 552.15 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: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:00,199 INFO L168 Benchmark]: TraceAbstraction took 7434.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 949.5 MB in the end (delta: 134.8 MB). Peak memory consumption was 200.9 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:00,200 INFO L168 Benchmark]: Witness Printer took 62.91 ms. Allocated memory is still 1.2 GB. Free memory was 949.5 MB in the beginning and 941.9 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:00,204 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.15 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 624.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 552.15 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: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7434.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 949.5 MB in the end (delta: 134.8 MB). Peak memory consumption was 200.9 MB. Max. memory is 11.5 GB. * Witness Printer took 62.91 ms. Allocated memory is still 1.2 GB. Free memory was 949.5 MB in the beginning and 941.9 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 5 error locations. SAFE Result, 7.3s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 218 SDtfs, 222 SDslu, 633 SDs, 0 SdLazy, 474 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 234 ConstructedInterpolants, 4 QuantifiedInterpolants, 33397 SizeOfPredicates, 27 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 9/38 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...