./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrspn-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/cstrspn-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 1f6e8c8b965f85c3429105401e9fda59f9f060cb ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:07:35,224 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:07:35,226 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:07:35,238 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:07:35,239 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:07:35,240 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:07:35,241 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:07:35,244 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:07:35,245 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:07:35,247 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:07:35,247 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:07:35,248 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:07:35,249 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:07:35,250 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:07:35,251 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:07:35,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:07:35,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:07:35,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:07:35,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:07:35,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:07:35,262 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:07:35,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:07:35,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:07:35,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:07:35,267 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:07:35,268 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:07:35,269 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:07:35,270 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:07:35,271 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:07:35,273 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:07:35,273 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:07:35,274 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:07:35,274 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:07:35,274 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:07:35,275 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:07:35,276 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:07:35,276 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:07:35,292 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:07:35,293 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:07:35,294 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:07:35,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:07:35,295 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:07:35,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:07:35,295 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:07:35,295 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:07:35,295 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:07:35,296 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:07:35,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:07:35,296 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:07:35,296 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:07:35,296 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:07:35,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:07:35,298 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:07:35,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:07:35,298 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:07:35,299 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:07:35,299 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:07:35,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:07:35,300 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:07:35,300 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:07:35,300 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:07:35,300 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:07:35,300 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 -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2019-01-14 18:07:35,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:07:35,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:07:35,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:07:35,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:07:35,357 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:07:35,358 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:35,416 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b376b39/912f40cc7a0f421a967014dcb0b4bef7/FLAG1a62f93bc [2019-01-14 18:07:35,929 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:07:35,930 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:35,943 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b376b39/912f40cc7a0f421a967014dcb0b4bef7/FLAG1a62f93bc [2019-01-14 18:07:36,247 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b376b39/912f40cc7a0f421a967014dcb0b4bef7 [2019-01-14 18:07:36,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:07:36,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:07:36,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:36,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:07:36,257 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:07:36,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:36" (1/1) ... [2019-01-14 18:07:36,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e34980e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:36, skipping insertion in model container [2019-01-14 18:07:36,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:36" (1/1) ... [2019-01-14 18:07:36,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:07:36,324 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:07:36,750 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:36,767 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:07:36,930 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:36,986 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:07:36,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:36 WrapperNode [2019-01-14 18:07:36,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:36,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:07:36,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:07:36,989 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:07:37,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:36" (1/1) ... [2019-01-14 18:07:37,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:36" (1/1) ... [2019-01-14 18:07:37,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:36" (1/1) ... [2019-01-14 18:07:37,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:36" (1/1) ... [2019-01-14 18:07:37,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:36" (1/1) ... [2019-01-14 18:07:37,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:36" (1/1) ... [2019-01-14 18:07:37,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:36" (1/1) ... [2019-01-14 18:07:37,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:07:37,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:07:37,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:07:37,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:07:37,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:07:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:07:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:07:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 18:07:37,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 18:07:37,131 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2019-01-14 18:07:37,131 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:07:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 18:07:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 18:07:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:07:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:07:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:07:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:07:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:07:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:07:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:07:37,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:07:37,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:07:37,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:07:37,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:07:37,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:07:37,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:07:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:07:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:07:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:07:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:07:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:07:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:07:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:07:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:07:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:07:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:07:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:07:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:07:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:07:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:07:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:07:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:07:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:07:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:07:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:07:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:07:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:07:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:07:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:07:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:07:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:07:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:07:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:07:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:07:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:07:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:07:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:07:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:07:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:07:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:07:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:07:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:07:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:07:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:07:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:07:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:07:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:07:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:07:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:07:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:07:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:07:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:07:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:07:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:07:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:07:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:07:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:07:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:07:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:07:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:07:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:07:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:07:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:07:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:07:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:07:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:07:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:07:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:07:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:07:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:07:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:07:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:07:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:07:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:07:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:07:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:07:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:07:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:07:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:07:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:07:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:07:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:07:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:07:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:07:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:07:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:07:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:07:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:07:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:07:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:07:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:07:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:07:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:07:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:07:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2019-01-14 18:07:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:07:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:07:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:07:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:07:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:07:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:07:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:07:37,871 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:07:37,872 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 18:07:37,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:37 BoogieIcfgContainer [2019-01-14 18:07:37,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:07:37,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:07:37,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:07:37,878 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:07:37,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:07:36" (1/3) ... [2019-01-14 18:07:37,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53af1adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:37, skipping insertion in model container [2019-01-14 18:07:37,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:36" (2/3) ... [2019-01-14 18:07:37,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53af1adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:37, skipping insertion in model container [2019-01-14 18:07:37,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:37" (3/3) ... [2019-01-14 18:07:37,881 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:37,889 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:07:37,896 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-14 18:07:37,912 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-14 18:07:37,938 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:07:37,939 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:07:37,939 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:07:37,939 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:07:37,940 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:07:37,940 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:07:37,940 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:07:37,940 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:07:37,940 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:07:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-01-14 18:07:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:37,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:37,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:37,971 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:37,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:37,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097680, now seen corresponding path program 1 times [2019-01-14 18:07:37,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:37,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:38,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:38,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:38,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:38,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:07:38,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:07:38,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:07:38,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:38,208 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-01-14 18:07:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:38,336 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-01-14 18:07:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:07:38,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:07:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:38,347 INFO L225 Difference]: With dead ends: 48 [2019-01-14 18:07:38,347 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 18:07:38,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 18:07:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-14 18:07:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 18:07:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-01-14 18:07:38,385 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2019-01-14 18:07:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:38,385 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-01-14 18:07:38,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:07:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-01-14 18:07:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:38,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:38,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:38,387 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:38,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:38,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097681, now seen corresponding path program 1 times [2019-01-14 18:07:38,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:38,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:38,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:38,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:38,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:38,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:38,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:38,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:38,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:38,554 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2019-01-14 18:07:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:38,614 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-01-14 18:07:38,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:38,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:07:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:38,616 INFO L225 Difference]: With dead ends: 44 [2019-01-14 18:07:38,616 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 18:07:38,617 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-14 18:07:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 18:07:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-14 18:07:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 18:07:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-01-14 18:07:38,624 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2019-01-14 18:07:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:38,625 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-01-14 18:07:38,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-01-14 18:07:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:07:38,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:38,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:38,626 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:38,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash 774453223, now seen corresponding path program 1 times [2019-01-14 18:07:38,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:38,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:38,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:38,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:07:38,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:07:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:07:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:38,733 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2019-01-14 18:07:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:38,810 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-01-14 18:07:38,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:07:38,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 18:07:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:38,813 INFO L225 Difference]: With dead ends: 43 [2019-01-14 18:07:38,814 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 18:07:38,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 18:07:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-14 18:07:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 18:07:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-14 18:07:38,823 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2019-01-14 18:07:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:38,824 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-14 18:07:38,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:07:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-01-14 18:07:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:07:38,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:38,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:38,827 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash 774453224, now seen corresponding path program 1 times [2019-01-14 18:07:38,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:38,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:38,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:38,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:38,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:38,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:38,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:38,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:38,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:38,928 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2019-01-14 18:07:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:38,955 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-01-14 18:07:38,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:38,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 18:07:38,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:38,958 INFO L225 Difference]: With dead ends: 42 [2019-01-14 18:07:38,958 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 18:07:38,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 18:07:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-14 18:07:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 18:07:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-01-14 18:07:38,964 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2019-01-14 18:07:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:38,964 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-01-14 18:07:38,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-01-14 18:07:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:07:38,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:38,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:38,965 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:38,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash -828291016, now seen corresponding path program 1 times [2019-01-14 18:07:38,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:38,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:39,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:39,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:07:39,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:07:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:07:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:07:39,037 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2019-01-14 18:07:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:39,431 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-01-14 18:07:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:07:39,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-14 18:07:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:39,434 INFO L225 Difference]: With dead ends: 40 [2019-01-14 18:07:39,434 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 18:07:39,434 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-14 18:07:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 18:07:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 18:07:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 18:07:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-14 18:07:39,439 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2019-01-14 18:07:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:39,440 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-14 18:07:39,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:07:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-14 18:07:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:07:39,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:39,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:39,441 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:39,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:39,441 INFO L82 PathProgramCache]: Analyzing trace with hash -828291015, now seen corresponding path program 1 times [2019-01-14 18:07:39,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:39,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:39,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:39,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:39,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:39,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:07:39,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:07:39,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:07:39,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:07:39,632 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2019-01-14 18:07:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:39,859 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-01-14 18:07:39,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:07:39,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-14 18:07:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:39,864 INFO L225 Difference]: With dead ends: 62 [2019-01-14 18:07:39,864 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 18:07:39,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:07:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 18:07:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2019-01-14 18:07:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 18:07:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-14 18:07:39,871 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2019-01-14 18:07:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:39,872 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-14 18:07:39,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:07:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-14 18:07:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:07:39,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:39,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:39,873 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:39,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:39,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1881695426, now seen corresponding path program 1 times [2019-01-14 18:07:39,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:39,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:39,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:39,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:39,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:39,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:07:39,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:07:39,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:07:39,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:07:39,993 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2019-01-14 18:07:40,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:40,124 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-01-14 18:07:40,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:07:40,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-14 18:07:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:40,127 INFO L225 Difference]: With dead ends: 43 [2019-01-14 18:07:40,127 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 18:07:40,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:07:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 18:07:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-01-14 18:07:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 18:07:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-01-14 18:07:40,133 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2019-01-14 18:07:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:40,133 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-14 18:07:40,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:07:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-01-14 18:07:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:07:40,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:40,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:40,134 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:40,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1881695425, now seen corresponding path program 1 times [2019-01-14 18:07:40,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:40,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:40,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:40,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:40,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:40,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:07:40,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:07:40,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:07:40,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:07:40,303 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2019-01-14 18:07:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:40,485 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2019-01-14 18:07:40,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:07:40,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-14 18:07:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:40,488 INFO L225 Difference]: With dead ends: 55 [2019-01-14 18:07:40,488 INFO L226 Difference]: Without dead ends: 55 [2019-01-14 18:07:40,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:07:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-14 18:07:40,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-01-14 18:07:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-14 18:07:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-01-14 18:07:40,494 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2019-01-14 18:07:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:40,494 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-01-14 18:07:40,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:07:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-01-14 18:07:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 18:07:40,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:40,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:40,495 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:40,496 INFO L82 PathProgramCache]: Analyzing trace with hash -145313269, now seen corresponding path program 1 times [2019-01-14 18:07:40,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:40,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:40,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:40,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:40,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:40,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:40,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:40,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:40,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:40,704 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2019-01-14 18:07:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:40,813 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-01-14 18:07:40,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:40,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-14 18:07:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:40,816 INFO L225 Difference]: With dead ends: 46 [2019-01-14 18:07:40,816 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 18:07:40,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 18:07:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-14 18:07:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 18:07:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-14 18:07:40,821 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2019-01-14 18:07:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:40,821 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-14 18:07:40,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-14 18:07:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:07:40,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:40,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:40,822 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:40,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:40,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1476836758, now seen corresponding path program 1 times [2019-01-14 18:07:40,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:40,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:40,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:40,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:40,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:40,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:40,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:07:40,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:07:40,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:40,899 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2019-01-14 18:07:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:40,941 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-01-14 18:07:40,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:07:40,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 18:07:40,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:40,943 INFO L225 Difference]: With dead ends: 43 [2019-01-14 18:07:40,943 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 18:07:40,944 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-14 18:07:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 18:07:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-14 18:07:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 18:07:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-14 18:07:40,949 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2019-01-14 18:07:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:40,949 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-14 18:07:40,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:07:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-14 18:07:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 18:07:40,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:40,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:40,955 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:40,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:40,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1895057779, now seen corresponding path program 1 times [2019-01-14 18:07:40,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:40,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:40,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:40,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:41,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:41,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:07:41,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:07:41,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:07:41,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:07:41,177 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 10 states. [2019-01-14 18:07:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:41,689 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-01-14 18:07:41,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 18:07:41,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-01-14 18:07:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:41,690 INFO L225 Difference]: With dead ends: 64 [2019-01-14 18:07:41,691 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 18:07:41,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-14 18:07:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 18:07:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-01-14 18:07:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 18:07:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-01-14 18:07:41,696 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 24 [2019-01-14 18:07:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:41,698 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-01-14 18:07:41,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:07:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-01-14 18:07:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 18:07:41,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:41,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:41,699 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:41,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:41,700 INFO L82 PathProgramCache]: Analyzing trace with hash 306709877, now seen corresponding path program 1 times [2019-01-14 18:07:41,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:41,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:41,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:42,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:42,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:07:42,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:42,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:42,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:07:42,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:42,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:42,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-14 18:07:42,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:07:42,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:07:42,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:42,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:42,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:42,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-14 18:07:42,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2019-01-14 18:07:42,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 18:07:42,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:42,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:42,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 18:07:42,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2019-01-14 18:07:43,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-01-14 18:07:43,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-14 18:07:43,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:43,028 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-14 18:07:43,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:43,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:43,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:43,036 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2019-01-14 18:07:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 18:07:43,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 18:07:43,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2019-01-14 18:07:43,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-14 18:07:43,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 18:07:43,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-01-14 18:07:43,106 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 19 states. [2019-01-14 18:07:43,371 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 18:07:45,687 WARN L181 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 18:07:48,186 WARN L181 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 18:07:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:48,753 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-01-14 18:07:48,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 18:07:48,754 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-01-14 18:07:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:48,756 INFO L225 Difference]: With dead ends: 101 [2019-01-14 18:07:48,757 INFO L226 Difference]: Without dead ends: 86 [2019-01-14 18:07:48,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 18:07:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-14 18:07:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2019-01-14 18:07:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 18:07:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-01-14 18:07:48,765 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2019-01-14 18:07:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:48,765 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-01-14 18:07:48,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-14 18:07:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-01-14 18:07:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 18:07:48,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:48,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:48,767 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1403727160, now seen corresponding path program 1 times [2019-01-14 18:07:48,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:48,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:48,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:48,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:48,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:07:48,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:07:48,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:07:48,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:07:48,919 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 10 states. [2019-01-14 18:07:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:49,160 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-01-14 18:07:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 18:07:49,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-01-14 18:07:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:49,162 INFO L225 Difference]: With dead ends: 69 [2019-01-14 18:07:49,162 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 18:07:49,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-01-14 18:07:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 18:07:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-01-14 18:07:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 18:07:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-01-14 18:07:49,167 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 25 [2019-01-14 18:07:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:49,167 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-01-14 18:07:49,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:07:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-01-14 18:07:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:07:49,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:49,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:49,168 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2074932103, now seen corresponding path program 1 times [2019-01-14 18:07:49,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:49,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:49,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:49,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:49,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:07:49,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:49,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:49,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:07:49,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:49,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:49,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-14 18:07:49,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-14 18:07:49,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 18:07:49,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:49,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:49,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:07:49,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-14 18:07:49,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-14 18:07:49,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 18:07:49,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:49,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:49,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 18:07:49,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-14 18:07:53,227 WARN L181 SmtUtils]: Spent 771.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 18:07:53,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2019-01-14 18:07:53,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-01-14 18:07:53,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-01-14 18:07:53,575 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 41 treesize of output 39 [2019-01-14 18:07:53,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:07:53,719 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 31 treesize of output 23 [2019-01-14 18:07:53,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:53,727 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 35 treesize of output 27 [2019-01-14 18:07:53,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:53,869 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 37 treesize of output 35 [2019-01-14 18:07:53,871 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-14 18:07:54,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-14 18:07:54,039 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:54,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2019-01-14 18:07:54,056 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:54,291 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 37 treesize of output 29 [2019-01-14 18:07:54,291 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:54,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 18:07:54,504 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:54,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2019-01-14 18:07:54,507 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:54,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2019-01-14 18:07:54,630 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2019-01-14 18:07:54,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-14 18:07:54,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:07:54,843 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2019-01-14 18:07:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:55,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:55,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2019-01-14 18:07:55,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 18:07:55,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 18:07:55,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2019-01-14 18:07:55,050 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 28 states. [2019-01-14 18:07:57,872 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-01-14 18:07:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:59,119 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2019-01-14 18:07:59,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 18:07:59,121 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-01-14 18:07:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:59,122 INFO L225 Difference]: With dead ends: 109 [2019-01-14 18:07:59,123 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 18:07:59,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 18:07:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 18:07:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2019-01-14 18:07:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-14 18:07:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-01-14 18:07:59,131 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 27 [2019-01-14 18:07:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:59,132 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-01-14 18:07:59,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 18:07:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-01-14 18:07:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:07:59,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:59,135 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:59,135 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:07:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:59,137 INFO L82 PathProgramCache]: Analyzing trace with hash -729755417, now seen corresponding path program 1 times [2019-01-14 18:07:59,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:59,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:59,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:59,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:59,525 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-14 18:07:59,697 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 18:07:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:59,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:59,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:07:59,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:00,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:00,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:08:00,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:08:00,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:00,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:00,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:00,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-14 18:08:00,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:08:00,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 18:08:00,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:00,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:00,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:00,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-14 18:08:00,303 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-14 18:08:00,312 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-14 18:08:00,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:00,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:00,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:00,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2019-01-14 18:08:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:00,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:00,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-01-14 18:08:00,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 18:08:00,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 18:08:00,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-01-14 18:08:00,487 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 22 states. [2019-01-14 18:08:01,583 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-01-14 18:08:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:02,273 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-01-14 18:08:02,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:08:02,275 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-01-14 18:08:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:02,276 INFO L225 Difference]: With dead ends: 92 [2019-01-14 18:08:02,276 INFO L226 Difference]: Without dead ends: 90 [2019-01-14 18:08:02,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 18:08:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-14 18:08:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2019-01-14 18:08:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 18:08:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-01-14 18:08:02,280 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 30 [2019-01-14 18:08:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:02,280 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-01-14 18:08:02,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 18:08:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-01-14 18:08:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 18:08:02,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:02,282 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:02,282 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:08:02,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:02,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1281582983, now seen corresponding path program 2 times [2019-01-14 18:08:02,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:02,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:02,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:02,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:02,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:02,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:02,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:08:02,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:08:02,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:08:02,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:08:02,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:02,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:08:02,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:02,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:02,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-01-14 18:08:02,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-14 18:08:02,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 18:08:02,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:02,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:02,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:08:02,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2019-01-14 18:08:02,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-14 18:08:02,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 18:08:02,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:02,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:02,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 18:08:02,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2019-01-14 18:08:04,358 WARN L181 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 18:08:05,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-01-14 18:08:05,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:08:05,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:08:05,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:08:05,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 33 [2019-01-14 18:08:05,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:05,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2019-01-14 18:08:05,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:05,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-14 18:08:05,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:05,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:05,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:05,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:51 [2019-01-14 18:08:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:05,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:05,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22] total 28 [2019-01-14 18:08:05,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 18:08:05,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 18:08:05,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=734, Unknown=1, NotChecked=0, Total=812 [2019-01-14 18:08:05,551 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 29 states. [2019-01-14 18:08:06,192 WARN L181 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-01-14 18:08:06,820 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-14 18:08:07,035 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-14 18:08:07,468 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-14 18:08:07,688 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-14 18:08:07,932 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-14 18:08:08,126 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-01-14 18:08:08,873 WARN L181 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-01-14 18:08:09,176 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-01-14 18:08:09,386 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-01-14 18:08:09,553 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-01-14 18:08:10,064 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-01-14 18:08:10,251 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-01-14 18:08:14,242 WARN L181 SmtUtils]: Spent 3.87 s on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-01-14 18:08:19,657 WARN L181 SmtUtils]: Spent 5.35 s on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-01-14 18:08:22,544 WARN L181 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-01-14 18:08:27,377 WARN L181 SmtUtils]: Spent 4.76 s on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-14 18:08:29,919 WARN L181 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-14 18:08:33,678 WARN L181 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-14 18:08:37,884 WARN L181 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-01-14 18:08:38,200 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-01-14 18:08:40,789 WARN L181 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-01-14 18:08:43,034 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-01-14 18:08:49,064 WARN L181 SmtUtils]: Spent 5.93 s on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-01-14 18:08:50,364 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-01-14 18:08:53,983 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-01-14 18:08:56,593 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-01-14 18:09:04,268 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-01-14 18:09:06,383 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-01-14 18:09:10,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:10,370 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2019-01-14 18:09:10,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 18:09:10,374 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2019-01-14 18:09:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:10,375 INFO L225 Difference]: With dead ends: 120 [2019-01-14 18:09:10,375 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 18:09:10,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 51.3s TimeCoverageRelationStatistics Valid=551, Invalid=3473, Unknown=8, NotChecked=0, Total=4032 [2019-01-14 18:09:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 18:09:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 89. [2019-01-14 18:09:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 18:09:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-01-14 18:09:10,380 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 40 [2019-01-14 18:09:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:10,381 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-01-14 18:09:10,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 18:09:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-01-14 18:09:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-14 18:09:10,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:10,383 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:10,383 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION]=== [2019-01-14 18:09:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:10,383 INFO L82 PathProgramCache]: Analyzing trace with hash 178768069, now seen corresponding path program 1 times [2019-01-14 18:09:10,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:10,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:10,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:10,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:09:10,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-14 18:09:11,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:11,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:11,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:11,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:11,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 18:09:11,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:09:11,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:11,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:11,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:09:11,541 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:11,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:11,558 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-14 18:09:11,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 18:09:11,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 18:09:11,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:11,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:11,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:11,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-14 18:09:11,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 18:09:11,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:09:11,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:11,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:11,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 18:09:11,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-14 18:09:13,373 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 18:09:13,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2019-01-14 18:09:13,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2019-01-14 18:09:13,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:14,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-01-14 18:09:14,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:14,821 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 40 treesize of output 30 [2019-01-14 18:09:14,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:14,888 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 32 treesize of output 30 [2019-01-14 18:09:14,888 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 18:09:14,968 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 37 treesize of output 27 [2019-01-14 18:09:14,969 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:15,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2019-01-14 18:09:15,391 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2019-01-14 18:09:15,557 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 27 treesize of output 25 [2019-01-14 18:09:15,558 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 18:09:15,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-14 18:09:15,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 18:09:15,725 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2019-01-14 18:09:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 18:09:15,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:15,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2019-01-14 18:09:15,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-14 18:09:15,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-14 18:09:15,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 18:09:15,913 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 33 states. [2019-01-14 18:09:17,240 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-01-14 18:09:18,163 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-14 18:09:26,720 WARN L181 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-01-14 18:09:27,531 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-01-14 18:09:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:27,970 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2019-01-14 18:09:27,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-14 18:09:27,971 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2019-01-14 18:09:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:27,972 INFO L225 Difference]: With dead ends: 103 [2019-01-14 18:09:27,972 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 18:09:27,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=842, Invalid=3850, Unknown=0, NotChecked=0, Total=4692 [2019-01-14 18:09:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 18:09:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 18:09:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 18:09:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 18:09:27,976 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2019-01-14 18:09:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:27,976 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 18:09:27,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-14 18:09:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 18:09:27,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 18:09:27,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:09:27 BoogieIcfgContainer [2019-01-14 18:09:27,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:09:27,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:09:27,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:09:27,988 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:09:27,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:37" (3/4) ... [2019-01-14 18:09:27,992 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 18:09:27,998 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 18:09:27,998 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 18:09:27,998 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 18:09:27,998 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 18:09:27,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2019-01-14 18:09:28,003 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-14 18:09:28,003 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-14 18:09:28,003 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 18:09:28,062 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:09:28,062 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:09:28,063 INFO L168 Benchmark]: Toolchain (without parser) took 111812.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 951.4 MB in the beginning and 886.1 MB in the end (delta: 65.2 MB). Peak memory consumption was 359.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:09:28,064 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:09:28,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -125.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:09:28,065 INFO L168 Benchmark]: Boogie Preprocessor took 76.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:09:28,065 INFO L168 Benchmark]: RCFGBuilder took 808.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2019-01-14 18:09:28,067 INFO L168 Benchmark]: TraceAbstraction took 110112.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Free memory was 1.0 GB in the beginning and 886.1 MB in the end (delta: 142.2 MB). Peak memory consumption was 332.6 MB. Max. memory is 11.5 GB. [2019-01-14 18:09:28,067 INFO L168 Benchmark]: Witness Printer took 74.82 ms. Allocated memory is still 1.3 GB. Free memory is still 886.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:09:28,071 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.14 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 734.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -125.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 808.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 110112.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Free memory was 1.0 GB in the beginning and 886.1 MB in the end (delta: 142.2 MB). Peak memory consumption was 332.6 MB. Max. memory is 11.5 GB. * Witness Printer took 74.82 ms. Allocated memory is still 1.3 GB. Free memory is still 886.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 15 error locations. SAFE Result, 110.0s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 90.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 504 SDtfs, 1566 SDslu, 1940 SDs, 0 SdLazy, 3456 SolverSat, 294 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 22.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 434 GetRequests, 131 SyntacticMatches, 7 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 79.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 163 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 535 ConstructedInterpolants, 89 QuantifiedInterpolants, 319687 SizeOfPredicates, 79 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 73/173 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...