./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/subseq-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/subseq-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 1ed241b7ea3188deab01745f11227ce75decf7bc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:57:29,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:57:29,463 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:57:29,479 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:57:29,479 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:57:29,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:57:29,482 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:57:29,483 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:57:29,485 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:57:29,486 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:57:29,487 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:57:29,487 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:57:29,488 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:57:29,491 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:57:29,494 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:57:29,496 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:57:29,498 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:57:29,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:57:29,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:57:29,510 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:57:29,512 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:57:29,514 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:57:29,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:57:29,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:57:29,521 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:57:29,522 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:57:29,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:57:29,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:57:29,527 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:57:29,528 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:57:29,528 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:57:29,529 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:57:29,529 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:57:29,529 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:57:29,530 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:57:29,531 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:57:29,531 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:57:29,553 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:57:29,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:57:29,555 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:57:29,555 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:57:29,555 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:57:29,555 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:57:29,556 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:57:29,556 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:57:29,556 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:57:29,556 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:57:29,556 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:57:29,557 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:57:29,557 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:57:29,557 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:57:29,557 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:57:29,557 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:57:29,557 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:57:29,558 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:57:29,558 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:57:29,558 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:57:29,558 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:57:29,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:57:29,559 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:57:29,559 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:57:29,559 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:57:29,559 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:57:29,559 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 -> 1ed241b7ea3188deab01745f11227ce75decf7bc [2019-01-13 21:57:29,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:57:29,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:57:29,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:57:29,641 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:57:29,642 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:57:29,643 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:57:29,699 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da03cc87/d8b5d93757a14ae0ad0df36a5e1a3345/FLAGda5afe0ad [2019-01-13 21:57:30,157 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:57:30,158 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:57:30,177 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da03cc87/d8b5d93757a14ae0ad0df36a5e1a3345/FLAGda5afe0ad [2019-01-13 21:57:30,474 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da03cc87/d8b5d93757a14ae0ad0df36a5e1a3345 [2019-01-13 21:57:30,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:57:30,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:57:30,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:57:30,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:57:30,484 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:57:30,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:57:30" (1/1) ... [2019-01-13 21:57:30,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348d6f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:30, skipping insertion in model container [2019-01-13 21:57:30,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:57:30" (1/1) ... [2019-01-13 21:57:30,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:57:30,535 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:57:30,885 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:57:30,902 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:57:30,955 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:57:31,001 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:57:31,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:31 WrapperNode [2019-01-13 21:57:31,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:57:31,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:57:31,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:57:31,003 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:57:31,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:31" (1/1) ... [2019-01-13 21:57:31,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:31" (1/1) ... [2019-01-13 21:57:31,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:31" (1/1) ... [2019-01-13 21:57:31,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:31" (1/1) ... [2019-01-13 21:57:31,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:31" (1/1) ... [2019-01-13 21:57:31,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:31" (1/1) ... [2019-01-13 21:57:31,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:31" (1/1) ... [2019-01-13 21:57:31,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:57:31,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:57:31,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:57:31,131 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:57:31,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:57:31,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:57:31,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:57:31,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:57:31,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:57:31,191 INFO L138 BoogieDeclarations]: Found implementation of procedure subseq [2019-01-13 21:57:31,191 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:57:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:57:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:57:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:57:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:57:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:57:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:57:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:57:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:57:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:57:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:57:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:57:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:57:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:57:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:57:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:57:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:57:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:57:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:57:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:57:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:57:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:57:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:57:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:57:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:57:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:57:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:57:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:57:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:57:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:57:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:57:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:57:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:57:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:57:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:57:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:57:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:57:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:57:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:57:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:57:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:57:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:57:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:57:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:57:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:57:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:57:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:57:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:57:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:57:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:57:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:57:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:57:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:57:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:57:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:57:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:57:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:57:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:57:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:57:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:57:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:57:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:57:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:57:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:57:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:57:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:57:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:57:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:57:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:57:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:57:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:57:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:57:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:57:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:57:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:57:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:57:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:57:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:57:31,203 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:57:31,203 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:57:31,203 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:57:31,203 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:57:31,203 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:57:31,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:57:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:57:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:57:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:57:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:57:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:57:31,204 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:57:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:57:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:57:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:57:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:57:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:57:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:57:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:57:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:57:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:57:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:57:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:57:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:57:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:57:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:57:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure subseq [2019-01-13 21:57:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:57:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:57:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:57:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:57:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:57:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:57:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:57:31,902 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:57:31,903 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-13 21:57:31,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:31 BoogieIcfgContainer [2019-01-13 21:57:31,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:57:31,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:57:31,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:57:31,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:57:31,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:57:30" (1/3) ... [2019-01-13 21:57:31,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eef5e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:57:31, skipping insertion in model container [2019-01-13 21:57:31,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:31" (2/3) ... [2019-01-13 21:57:31,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eef5e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:57:31, skipping insertion in model container [2019-01-13 21:57:31,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:31" (3/3) ... [2019-01-13 21:57:31,913 INFO L112 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:57:31,923 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:57:31,934 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-13 21:57:31,946 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-13 21:57:31,970 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:57:31,970 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:57:31,971 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:57:31,971 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:57:31,971 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:57:31,971 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:57:31,971 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:57:31,971 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:57:31,972 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:57:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-01-13 21:57:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:57:31,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:31,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:31,996 INFO L423 AbstractCegarLoop]: === Iteration 1 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:32,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash 364110360, now seen corresponding path program 1 times [2019-01-13 21:57:32,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:32,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:32,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:32,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:32,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:32,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:32,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:57:32,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:57:32,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:57:32,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:32,233 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-01-13 21:57:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:32,323 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-01-13 21:57:32,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:57:32,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:57:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:32,334 INFO L225 Difference]: With dead ends: 46 [2019-01-13 21:57:32,334 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:57:32,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:32,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:57:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 21:57:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:57:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-13 21:57:32,375 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2019-01-13 21:57:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:32,375 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-13 21:57:32,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:57:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-01-13 21:57:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:57:32,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:32,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:32,377 INFO L423 AbstractCegarLoop]: === Iteration 2 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash 364110361, now seen corresponding path program 1 times [2019-01-13 21:57:32,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:32,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:32,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:32,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:32,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:32,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:32,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:32,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:32,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:32,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:32,675 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2019-01-13 21:57:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:32,757 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-01-13 21:57:32,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:32,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:57:32,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:32,759 INFO L225 Difference]: With dead ends: 42 [2019-01-13 21:57:32,759 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:57:32,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:57:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-13 21:57:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 21:57:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-01-13 21:57:32,766 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2019-01-13 21:57:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:32,767 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-01-13 21:57:32,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-01-13 21:57:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:57:32,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:32,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:32,768 INFO L423 AbstractCegarLoop]: === Iteration 3 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:32,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1597480737, now seen corresponding path program 1 times [2019-01-13 21:57:32,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:32,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:32,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:32,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:32,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:32,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:32,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:57:32,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:57:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:57:32,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:32,842 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2019-01-13 21:57:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:33,000 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-01-13 21:57:33,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:57:33,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 21:57:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:33,002 INFO L225 Difference]: With dead ends: 41 [2019-01-13 21:57:33,003 INFO L226 Difference]: Without dead ends: 41 [2019-01-13 21:57:33,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:33,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-13 21:57:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-13 21:57:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 21:57:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-01-13 21:57:33,011 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2019-01-13 21:57:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:33,011 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-01-13 21:57:33,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:57:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-01-13 21:57:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:57:33,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:33,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:33,012 INFO L423 AbstractCegarLoop]: === Iteration 4 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1597480736, now seen corresponding path program 1 times [2019-01-13 21:57:33,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:33,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:33,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:33,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:33,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:33,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:33,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:33,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:33,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:33,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:33,153 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2019-01-13 21:57:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:33,209 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-01-13 21:57:33,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:33,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:57:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:33,211 INFO L225 Difference]: With dead ends: 40 [2019-01-13 21:57:33,211 INFO L226 Difference]: Without dead ends: 40 [2019-01-13 21:57:33,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-13 21:57:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-13 21:57:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:57:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-13 21:57:33,217 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 11 [2019-01-13 21:57:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:33,217 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-13 21:57:33,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-13 21:57:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:57:33,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:33,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:33,218 INFO L423 AbstractCegarLoop]: === Iteration 5 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:33,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:33,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1984019961, now seen corresponding path program 1 times [2019-01-13 21:57:33,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:33,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:33,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:33,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:33,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:33,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:33,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:57:33,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:57:33,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:57:33,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:57:33,287 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2019-01-13 21:57:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:33,712 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-01-13 21:57:33,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:57:33,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-13 21:57:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:33,714 INFO L225 Difference]: With dead ends: 38 [2019-01-13 21:57:33,714 INFO L226 Difference]: Without dead ends: 38 [2019-01-13 21:57:33,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:57:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-13 21:57:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-13 21:57:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-13 21:57:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-01-13 21:57:33,719 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 14 [2019-01-13 21:57:33,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:33,720 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-13 21:57:33,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:57:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-01-13 21:57:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:57:33,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:33,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:33,721 INFO L423 AbstractCegarLoop]: === Iteration 6 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:33,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:33,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1984019962, now seen corresponding path program 1 times [2019-01-13 21:57:33,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:33,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:33,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:33,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:33,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:33,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:33,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:57:33,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:57:33,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:57:33,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:57:33,866 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2019-01-13 21:57:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:34,093 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-01-13 21:57:34,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:57:34,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-13 21:57:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:34,097 INFO L225 Difference]: With dead ends: 58 [2019-01-13 21:57:34,098 INFO L226 Difference]: Without dead ends: 58 [2019-01-13 21:57:34,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:57:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-13 21:57:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2019-01-13 21:57:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 21:57:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-01-13 21:57:34,105 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 14 [2019-01-13 21:57:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:34,105 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-01-13 21:57:34,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:57:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-01-13 21:57:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 21:57:34,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:34,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:34,107 INFO L423 AbstractCegarLoop]: === Iteration 7 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:34,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:34,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1401263346, now seen corresponding path program 1 times [2019-01-13 21:57:34,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:34,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:34,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:34,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:34,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:34,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:34,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:57:34,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:57:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:57:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:57:34,194 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 5 states. [2019-01-13 21:57:34,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:34,324 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-01-13 21:57:34,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:57:34,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-13 21:57:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:34,326 INFO L225 Difference]: With dead ends: 45 [2019-01-13 21:57:34,328 INFO L226 Difference]: Without dead ends: 45 [2019-01-13 21:57:34,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:57:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-13 21:57:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-13 21:57:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 21:57:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2019-01-13 21:57:34,337 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 17 [2019-01-13 21:57:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:34,338 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-01-13 21:57:34,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:57:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2019-01-13 21:57:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 21:57:34,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:34,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:34,339 INFO L423 AbstractCegarLoop]: === Iteration 8 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:34,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:34,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1401263345, now seen corresponding path program 1 times [2019-01-13 21:57:34,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:34,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:34,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:34,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:34,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:34,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:34,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:57:34,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:57:34,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:57:34,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:57:34,450 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 7 states. [2019-01-13 21:57:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:34,621 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-01-13 21:57:34,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:57:34,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-01-13 21:57:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:34,623 INFO L225 Difference]: With dead ends: 60 [2019-01-13 21:57:34,623 INFO L226 Difference]: Without dead ends: 60 [2019-01-13 21:57:34,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-13 21:57:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-01-13 21:57:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-13 21:57:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-01-13 21:57:34,632 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2019-01-13 21:57:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:34,633 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-01-13 21:57:34,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:57:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2019-01-13 21:57:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 21:57:34,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:34,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:34,634 INFO L423 AbstractCegarLoop]: === Iteration 9 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:34,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:34,635 INFO L82 PathProgramCache]: Analyzing trace with hash 262199082, now seen corresponding path program 1 times [2019-01-13 21:57:34,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:34,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:34,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:34,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:34,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:34,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:34,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:34,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:57:34,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:57:34,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:34,683 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 3 states. [2019-01-13 21:57:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:34,701 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2019-01-13 21:57:34,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:57:34,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-13 21:57:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:34,703 INFO L225 Difference]: With dead ends: 57 [2019-01-13 21:57:34,703 INFO L226 Difference]: Without dead ends: 57 [2019-01-13 21:57:34,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-13 21:57:34,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-01-13 21:57:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-13 21:57:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2019-01-13 21:57:34,710 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 22 [2019-01-13 21:57:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:34,710 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2019-01-13 21:57:34,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:57:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2019-01-13 21:57:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:57:34,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:34,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:34,719 INFO L423 AbstractCegarLoop]: === Iteration 10 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1761616738, now seen corresponding path program 1 times [2019-01-13 21:57:34,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:34,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:34,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:34,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:34,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:34,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:34,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:34,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:34,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:34,981 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2019-01-13 21:57:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:35,093 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-01-13 21:57:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:35,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-13 21:57:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:35,095 INFO L225 Difference]: With dead ends: 55 [2019-01-13 21:57:35,095 INFO L226 Difference]: Without dead ends: 48 [2019-01-13 21:57:35,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-13 21:57:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-13 21:57:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 21:57:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2019-01-13 21:57:35,102 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 23 [2019-01-13 21:57:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:35,103 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2019-01-13 21:57:35,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2019-01-13 21:57:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:57:35,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:35,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:35,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:35,107 INFO L82 PathProgramCache]: Analyzing trace with hash -685750361, now seen corresponding path program 1 times [2019-01-13 21:57:35,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:35,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:35,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:35,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:35,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:35,387 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-13 21:57:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:35,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:35,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 21:57:35,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 21:57:35,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 21:57:35,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:57:35,524 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 12 states. [2019-01-13 21:57:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:36,008 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2019-01-13 21:57:36,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 21:57:36,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-01-13 21:57:36,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:36,011 INFO L225 Difference]: With dead ends: 90 [2019-01-13 21:57:36,011 INFO L226 Difference]: Without dead ends: 90 [2019-01-13 21:57:36,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-01-13 21:57:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-13 21:57:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2019-01-13 21:57:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-13 21:57:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-01-13 21:57:36,024 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 24 [2019-01-13 21:57:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:36,024 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-01-13 21:57:36,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 21:57:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-01-13 21:57:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:57:36,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:36,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:36,030 INFO L423 AbstractCegarLoop]: === Iteration 12 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:36,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2020869033, now seen corresponding path program 1 times [2019-01-13 21:57:36,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:36,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:36,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:36,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:36,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:36,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:36,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 21:57:36,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 21:57:36,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 21:57:36,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:57:36,470 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 9 states. [2019-01-13 21:57:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:36,704 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2019-01-13 21:57:36,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 21:57:36,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-01-13 21:57:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:36,707 INFO L225 Difference]: With dead ends: 79 [2019-01-13 21:57:36,707 INFO L226 Difference]: Without dead ends: 62 [2019-01-13 21:57:36,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-13 21:57:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-13 21:57:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-13 21:57:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-13 21:57:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-01-13 21:57:36,712 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 24 [2019-01-13 21:57:36,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:36,713 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-01-13 21:57:36,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 21:57:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-01-13 21:57:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:57:36,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:36,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:36,715 INFO L423 AbstractCegarLoop]: === Iteration 13 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash 26724327, now seen corresponding path program 1 times [2019-01-13 21:57:36,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:36,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:36,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:36,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:36,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:37,212 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2019-01-13 21:57:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:37,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:37,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:37,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:37,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:37,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:57:37,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:37,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:37,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:57:37,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:57:37,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-13 21:57:37,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:37,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:37,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:37,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-13 21:57:37,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-13 21:57:37,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-13 21:57:37,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:37,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:37,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:37,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-13 21:57:39,458 WARN L181 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-13 21:57:39,639 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-13 21:57:39,665 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 41 treesize of output 33 [2019-01-13 21:57:39,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:39,799 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-13 21:57:39,800 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:39,881 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-13 21:57:39,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:39,892 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-13 21:57:39,893 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:39,987 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-13 21:57:39,989 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2019-01-13 21:57:40,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-13 21:57:40,097 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:40,103 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-13 21:57:40,104 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:40,263 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 33 treesize of output 49 [2019-01-13 21:57:40,265 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2019-01-13 21:57:40,417 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 37 treesize of output 29 [2019-01-13 21:57:40,418 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:40,608 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 29 treesize of output 27 [2019-01-13 21:57:40,610 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:40,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-13 21:57:40,840 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-13 21:57:40,840 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2019-01-13 21:57:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:40,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:40,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 21 [2019-01-13 21:57:40,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 21:57:40,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 21:57:40,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-01-13 21:57:40,989 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 22 states. [2019-01-13 21:57:41,162 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2019-01-13 21:57:43,782 WARN L181 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-01-13 21:57:44,827 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-01-13 21:57:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:47,194 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-01-13 21:57:47,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-13 21:57:47,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2019-01-13 21:57:47,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:47,199 INFO L225 Difference]: With dead ends: 66 [2019-01-13 21:57:47,199 INFO L226 Difference]: Without dead ends: 66 [2019-01-13 21:57:47,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2019-01-13 21:57:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-13 21:57:47,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-01-13 21:57:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-13 21:57:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-01-13 21:57:47,206 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 24 [2019-01-13 21:57:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:47,207 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-01-13 21:57:47,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 21:57:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-01-13 21:57:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 21:57:47,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:47,210 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:47,210 INFO L423 AbstractCegarLoop]: === Iteration 14 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:47,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1844608382, now seen corresponding path program 1 times [2019-01-13 21:57:47,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:47,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:47,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:47,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:47,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 21:57:47,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 21:57:47,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 21:57:47,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:57:47,396 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 9 states. [2019-01-13 21:57:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:47,554 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-01-13 21:57:47,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 21:57:47,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-01-13 21:57:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:47,556 INFO L225 Difference]: With dead ends: 47 [2019-01-13 21:57:47,556 INFO L226 Difference]: Without dead ends: 36 [2019-01-13 21:57:47,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-13 21:57:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-13 21:57:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-13 21:57:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-13 21:57:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-01-13 21:57:47,561 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2019-01-13 21:57:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:47,561 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-01-13 21:57:47,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 21:57:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-01-13 21:57:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 21:57:47,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:47,564 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:47,564 INFO L423 AbstractCegarLoop]: === Iteration 15 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1575452162, now seen corresponding path program 1 times [2019-01-13 21:57:47,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:47,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:47,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:47,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:47,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:48,078 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-13 21:57:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:48,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:48,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:48,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:48,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:48,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:57:48,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-13 21:57:48,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:48,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:48,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:48,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-13 21:57:48,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-01-13 21:57:48,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:57:48,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:48,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:48,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:48,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2019-01-13 21:57:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:48,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:48,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2019-01-13 21:57:48,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 21:57:48,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 21:57:48,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:57:48,588 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 20 states. [2019-01-13 21:57:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:49,690 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2019-01-13 21:57:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 21:57:49,692 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-01-13 21:57:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:49,693 INFO L225 Difference]: With dead ends: 50 [2019-01-13 21:57:49,693 INFO L226 Difference]: Without dead ends: 48 [2019-01-13 21:57:49,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2019-01-13 21:57:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-13 21:57:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-01-13 21:57:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-13 21:57:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-01-13 21:57:49,698 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 27 [2019-01-13 21:57:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:49,699 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-01-13 21:57:49,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 21:57:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-01-13 21:57:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 21:57:49,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:49,700 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:49,700 INFO L423 AbstractCegarLoop]: === Iteration 16 === [subseqErr5REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr3REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:57:49,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1816536437, now seen corresponding path program 2 times [2019-01-13 21:57:49,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:49,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:49,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:49,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:49,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:50,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:50,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:57:50,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:57:50,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:57:50,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:57:50,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:50,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:50,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:50,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:50,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:50,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:50,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-13 21:57:50,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:57:50,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:57:50,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:50,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:50,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:50,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-01-13 21:57:50,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-13 21:57:50,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 21:57:50,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:50,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:50,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:50,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2019-01-13 21:57:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:50,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:50,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-01-13 21:57:50,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 21:57:50,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 21:57:50,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-01-13 21:57:50,885 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 22 states. [2019-01-13 21:57:51,747 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-01-13 21:57:52,040 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-01-13 21:57:52,184 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-01-13 21:57:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:53,039 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-13 21:57:53,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 21:57:53,041 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-01-13 21:57:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:53,041 INFO L225 Difference]: With dead ends: 45 [2019-01-13 21:57:53,041 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:57:53,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2019-01-13 21:57:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:57:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:57:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:57:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:57:53,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-01-13 21:57:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:53,045 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:57:53,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 21:57:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:57:53,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:57:53,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:57:53 BoogieIcfgContainer [2019-01-13 21:57:53,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:57:53,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:57:53,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:57:53,056 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:57:53,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:31" (3/4) ... [2019-01-13 21:57:53,063 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:57:53,071 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:57:53,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure subseq [2019-01-13 21:57:53,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:57:53,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:57:53,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:57:53,082 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-13 21:57:53,082 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-13 21:57:53,083 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 21:57:53,176 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:57:53,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:57:53,179 INFO L168 Benchmark]: Toolchain (without parser) took 22699.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -126.9 MB). Peak memory consumption was 178.7 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:53,179 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:57:53,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.10 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:53,180 INFO L168 Benchmark]: Boogie Preprocessor took 128.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:53,180 INFO L168 Benchmark]: RCFGBuilder took 773.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:53,183 INFO L168 Benchmark]: TraceAbstraction took 21150.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.9 MB). Peak memory consumption was 153.4 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:53,184 INFO L168 Benchmark]: Witness Printer took 120.83 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:53,185 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 522.10 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 128.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 773.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21150.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.9 MB). Peak memory consumption was 153.4 MB. Max. memory is 11.5 GB. * Witness Printer took 120.83 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: 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, 53 locations, 15 error locations. SAFE Result, 21.0s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 477 SDtfs, 760 SDslu, 1399 SDs, 0 SdLazy, 1590 SolverSat, 148 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 63 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 381 ConstructedInterpolants, 32 QuantifiedInterpolants, 93297 SizeOfPredicates, 32 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 11/53 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...