./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.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 5cff20f2f9db1407772cc4ac909fa32770d83e71 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:04:43,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:04:43,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:04:43,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:04:43,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:04:43,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:04:43,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:04:43,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:04:43,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:04:43,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:04:43,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:04:43,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:04:43,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:04:43,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:04:43,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:04:43,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:04:43,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:04:43,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:04:43,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:04:43,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:04:43,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:04:43,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:04:43,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:04:43,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:04:43,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:04:43,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:04:43,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:04:43,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:04:43,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:04:43,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:04:43,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:04:43,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:04:43,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:04:43,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:04:43,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:04:43,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:04:43,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:04:43,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:04:43,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:04:43,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:04:43,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:04:43,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:04:43,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:04:43,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:04:43,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:04:43,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:04:43,253 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:04:43,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:04:43,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:04:43,254 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:04:43,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:04:43,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:04:43,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:04:43,255 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:04:43,255 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:04:43,255 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:04:43,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:04:43,256 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:04:43,256 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:04:43,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:04:43,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:04:43,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:04:43,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:04:43,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:04:43,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:04:43,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:04:43,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:04:43,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:04:43,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:04:43,259 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:04:43,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 5cff20f2f9db1407772cc4ac909fa32770d83e71 [2019-11-28 20:04:43,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:04:43,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:04:43,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:04:43,602 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:04:43,603 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:04:43,603 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2019-11-28 20:04:43,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55dac6c97/1a38a41ea4184124889ec837e1e18778/FLAG50adf2d0c [2019-11-28 20:04:44,226 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:04:44,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2019-11-28 20:04:44,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55dac6c97/1a38a41ea4184124889ec837e1e18778/FLAG50adf2d0c [2019-11-28 20:04:44,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55dac6c97/1a38a41ea4184124889ec837e1e18778 [2019-11-28 20:04:44,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:04:44,510 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:04:44,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:04:44,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:04:44,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:04:44,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:04:44" (1/1) ... [2019-11-28 20:04:44,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cfe08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:44, skipping insertion in model container [2019-11-28 20:04:44,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:04:44" (1/1) ... [2019-11-28 20:04:44,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:04:44,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:04:45,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:04:45,023 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:04:45,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:04:45,173 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:04:45,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:45 WrapperNode [2019-11-28 20:04:45,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:04:45,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:04:45,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:04:45,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:04:45,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:45" (1/1) ... [2019-11-28 20:04:45,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:45" (1/1) ... [2019-11-28 20:04:45,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:45" (1/1) ... [2019-11-28 20:04:45,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:45" (1/1) ... [2019-11-28 20:04:45,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:45" (1/1) ... [2019-11-28 20:04:45,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:45" (1/1) ... [2019-11-28 20:04:45,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:45" (1/1) ... [2019-11-28 20:04:45,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:04:45,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:04:45,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:04:45,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:04:45,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:45" (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-11-28 20:04:45,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:04:45,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:04:45,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 20:04:45,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 20:04:45,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 20:04:45,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 20:04:45,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 20:04:45,298 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2019-11-28 20:04:45,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:04:45,298 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:04:45,299 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:04:45,299 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:04:45,299 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:04:45,299 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:04:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:04:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:04:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:04:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:04:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:04:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:04:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:04:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:04:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:04:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:04:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:04:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 20:04:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 20:04:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 20:04:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 20:04:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 20:04:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:04:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:04:45,304 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:04:45,304 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:04:45,304 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:04:45,304 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:04:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:04:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:04:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:04:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:04:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:04:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:04:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:04:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:04:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:04:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:04:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:04:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:04:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:04:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:04:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:04:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:04:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:04:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:04:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:04:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:04:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:04:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:04:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:04:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:04:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:04:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:04:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:04:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:04:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:04:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:04:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:04:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:04:45,312 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:04:45,312 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:04:45,312 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:04:45,312 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:04:45,312 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:04:45,313 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:04:45,313 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:04:45,313 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:04:45,313 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:04:45,313 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:04:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:04:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:04:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:04:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:04:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:04:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:04:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:04:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:04:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:04:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:04:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:04:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:04:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:04:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:04:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:04:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:04:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:04:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:04:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:04:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:04:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:04:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:04:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:04:45,319 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:04:45,319 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:04:45,319 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:04:45,319 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:04:45,319 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:04:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:04:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:04:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:04:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:04:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:04:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:04:45,321 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:04:45,321 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:04:45,321 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:04:45,321 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:04:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:04:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-28 20:04:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2019-11-28 20:04:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:04:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:04:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:04:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:04:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:04:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:04:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:04:45,918 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:04:45,919 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 20:04:45,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:04:45 BoogieIcfgContainer [2019-11-28 20:04:45,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:04:45,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:04:45,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:04:45,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:04:45,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:04:44" (1/3) ... [2019-11-28 20:04:45,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6337b97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:04:45, skipping insertion in model container [2019-11-28 20:04:45,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:45" (2/3) ... [2019-11-28 20:04:45,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6337b97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:04:45, skipping insertion in model container [2019-11-28 20:04:45,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:04:45" (3/3) ... [2019-11-28 20:04:45,929 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2019-11-28 20:04:45,939 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:04:45,950 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-28 20:04:45,962 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-28 20:04:45,981 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:04:45,981 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:04:45,981 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:04:45,982 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:04:45,982 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:04:45,982 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:04:45,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:04:45,983 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:04:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-28 20:04:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:46,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:46,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:46,006 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:46,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:46,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1363313202, now seen corresponding path program 1 times [2019-11-28 20:04:46,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:46,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121355064] [2019-11-28 20:04:46,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:46,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121355064] [2019-11-28 20:04:46,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:46,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:04:46,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718816710] [2019-11-28 20:04:46,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:46,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:46,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:46,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:46,271 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2019-11-28 20:04:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:46,577 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-11-28 20:04:46,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:04:46,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 20:04:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:46,594 INFO L225 Difference]: With dead ends: 83 [2019-11-28 20:04:46,594 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 20:04:46,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:04:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 20:04:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2019-11-28 20:04:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 20:04:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-11-28 20:04:46,647 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 11 [2019-11-28 20:04:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:46,648 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-11-28 20:04:46,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-11-28 20:04:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:46,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:46,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:46,650 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1361466160, now seen corresponding path program 1 times [2019-11-28 20:04:46,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:46,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348338517] [2019-11-28 20:04:46,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:46,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348338517] [2019-11-28 20:04:46,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:46,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:04:46,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570622751] [2019-11-28 20:04:46,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:04:46,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:46,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:04:46,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:04:46,774 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 4 states. [2019-11-28 20:04:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:46,943 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-11-28 20:04:46,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:04:46,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 20:04:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:46,945 INFO L225 Difference]: With dead ends: 60 [2019-11-28 20:04:46,946 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 20:04:46,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:04:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 20:04:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-28 20:04:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 20:04:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2019-11-28 20:04:46,955 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 11 [2019-11-28 20:04:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:46,956 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2019-11-28 20:04:46,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:04:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2019-11-28 20:04:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:46,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:46,958 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:46,958 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:46,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1361466159, now seen corresponding path program 1 times [2019-11-28 20:04:46,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:46,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731284088] [2019-11-28 20:04:46,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:47,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731284088] [2019-11-28 20:04:47,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:47,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:04:47,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294053752] [2019-11-28 20:04:47,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:47,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:47,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:47,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:47,099 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 5 states. [2019-11-28 20:04:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:47,350 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-11-28 20:04:47,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:04:47,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 20:04:47,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:47,352 INFO L225 Difference]: With dead ends: 80 [2019-11-28 20:04:47,352 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 20:04:47,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-28 20:04:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 20:04:47,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2019-11-28 20:04:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 20:04:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-11-28 20:04:47,362 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 11 [2019-11-28 20:04:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:47,362 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-11-28 20:04:47,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-11-28 20:04:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:04:47,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:47,364 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:47,364 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash -179010490, now seen corresponding path program 1 times [2019-11-28 20:04:47,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:47,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637467087] [2019-11-28 20:04:47,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:47,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637467087] [2019-11-28 20:04:47,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:47,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:04:47,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047016860] [2019-11-28 20:04:47,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:47,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:47,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:47,469 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 5 states. [2019-11-28 20:04:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:47,641 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-11-28 20:04:47,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:04:47,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 20:04:47,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:47,643 INFO L225 Difference]: With dead ends: 61 [2019-11-28 20:04:47,643 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 20:04:47,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:04:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 20:04:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-28 20:04:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 20:04:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-11-28 20:04:47,659 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 13 [2019-11-28 20:04:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:47,660 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-11-28 20:04:47,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-11-28 20:04:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:04:47,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:47,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:47,661 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:47,662 INFO L82 PathProgramCache]: Analyzing trace with hash -179010438, now seen corresponding path program 1 times [2019-11-28 20:04:47,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:47,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928083638] [2019-11-28 20:04:47,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:47,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928083638] [2019-11-28 20:04:47,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:47,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:04:47,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690306067] [2019-11-28 20:04:47,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:04:47,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:47,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:04:47,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:04:47,747 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 4 states. [2019-11-28 20:04:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:47,875 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-11-28 20:04:47,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:04:47,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 20:04:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:47,876 INFO L225 Difference]: With dead ends: 59 [2019-11-28 20:04:47,876 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 20:04:47,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:04:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 20:04:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-28 20:04:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 20:04:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-11-28 20:04:47,883 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 13 [2019-11-28 20:04:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:47,884 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-11-28 20:04:47,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:04:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-11-28 20:04:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:04:47,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:47,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:47,886 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash -179010437, now seen corresponding path program 1 times [2019-11-28 20:04:47,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:47,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708603069] [2019-11-28 20:04:47,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:47,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708603069] [2019-11-28 20:04:47,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:47,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:04:47,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103974455] [2019-11-28 20:04:47,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:47,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:47,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:47,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:47,960 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 5 states. [2019-11-28 20:04:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:48,116 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2019-11-28 20:04:48,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:04:48,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 20:04:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:48,118 INFO L225 Difference]: With dead ends: 78 [2019-11-28 20:04:48,118 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 20:04:48,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:04:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 20:04:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2019-11-28 20:04:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 20:04:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-11-28 20:04:48,127 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 13 [2019-11-28 20:04:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:48,127 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-11-28 20:04:48,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-11-28 20:04:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:04:48,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:48,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:48,129 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash -121752135, now seen corresponding path program 1 times [2019-11-28 20:04:48,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:48,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477440057] [2019-11-28 20:04:48,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:48,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477440057] [2019-11-28 20:04:48,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:48,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:04:48,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904346597] [2019-11-28 20:04:48,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:04:48,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:48,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:04:48,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:04:48,222 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 6 states. [2019-11-28 20:04:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:48,404 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2019-11-28 20:04:48,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:04:48,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-28 20:04:48,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:48,407 INFO L225 Difference]: With dead ends: 81 [2019-11-28 20:04:48,408 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 20:04:48,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:04:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 20:04:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-11-28 20:04:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 20:04:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-11-28 20:04:48,415 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 13 [2019-11-28 20:04:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:48,415 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-11-28 20:04:48,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:04:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-11-28 20:04:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:04:48,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:48,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:48,416 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1254357838, now seen corresponding path program 1 times [2019-11-28 20:04:48,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:48,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997253361] [2019-11-28 20:04:48,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:48,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997253361] [2019-11-28 20:04:48,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:48,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:04:48,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379968341] [2019-11-28 20:04:48,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:48,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:48,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:48,490 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 5 states. [2019-11-28 20:04:48,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:48,640 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2019-11-28 20:04:48,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:04:48,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 20:04:48,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:48,642 INFO L225 Difference]: With dead ends: 71 [2019-11-28 20:04:48,642 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 20:04:48,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:04:48,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 20:04:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 20:04:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 20:04:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-11-28 20:04:48,649 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 14 [2019-11-28 20:04:48,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:48,649 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-11-28 20:04:48,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-11-28 20:04:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:04:48,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:48,650 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:48,651 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:48,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:48,651 INFO L82 PathProgramCache]: Analyzing trace with hash 498238100, now seen corresponding path program 1 times [2019-11-28 20:04:48,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:48,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510082027] [2019-11-28 20:04:48,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:48,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510082027] [2019-11-28 20:04:48,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598621541] [2019-11-28 20:04:48,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:48,917 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 20:04:48,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:04:48,985 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-11-28 20:04:48,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:04:49,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 20:04:49,010 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:49,029 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:49,039 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-28 20:04:49,040 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:49,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:49,052 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:04:49,052 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-28 20:04:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:49,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:04:49,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-28 20:04:49,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237009026] [2019-11-28 20:04:49,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:04:49,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:49,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:04:49,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:04:49,073 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 7 states. [2019-11-28 20:04:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:49,264 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2019-11-28 20:04:49,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:04:49,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 20:04:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:49,266 INFO L225 Difference]: With dead ends: 90 [2019-11-28 20:04:49,266 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 20:04:49,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:04:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 20:04:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-11-28 20:04:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 20:04:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-11-28 20:04:49,281 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 15 [2019-11-28 20:04:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:49,281 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-11-28 20:04:49,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:04:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-11-28 20:04:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:04:49,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:49,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:49,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:49,487 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:49,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:49,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1936156247, now seen corresponding path program 1 times [2019-11-28 20:04:49,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:49,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16234829] [2019-11-28 20:04:49,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:49,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16234829] [2019-11-28 20:04:49,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:49,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:04:49,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519688467] [2019-11-28 20:04:49,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:04:49,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:49,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:04:49,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:04:49,566 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 6 states. [2019-11-28 20:04:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:49,716 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-11-28 20:04:49,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:04:49,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-28 20:04:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:49,717 INFO L225 Difference]: With dead ends: 64 [2019-11-28 20:04:49,717 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 20:04:49,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:04:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 20:04:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-28 20:04:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 20:04:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-28 20:04:49,727 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 17 [2019-11-28 20:04:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:49,727 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-28 20:04:49,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:04:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-11-28 20:04:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:04:49,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:49,731 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:49,731 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:49,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:49,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1936156248, now seen corresponding path program 1 times [2019-11-28 20:04:49,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:49,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041199207] [2019-11-28 20:04:49,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:49,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041199207] [2019-11-28 20:04:49,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:49,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:04:49,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746486251] [2019-11-28 20:04:49,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:04:49,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:04:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:04:49,851 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 8 states. [2019-11-28 20:04:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:50,129 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2019-11-28 20:04:50,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:04:50,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-28 20:04:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:50,133 INFO L225 Difference]: With dead ends: 86 [2019-11-28 20:04:50,133 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 20:04:50,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:04:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 20:04:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-11-28 20:04:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 20:04:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2019-11-28 20:04:50,139 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 17 [2019-11-28 20:04:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:50,139 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2019-11-28 20:04:50,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:04:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2019-11-28 20:04:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:04:50,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:50,141 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:50,141 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:50,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1591790588, now seen corresponding path program 1 times [2019-11-28 20:04:50,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:50,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101775080] [2019-11-28 20:04:50,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:50,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101775080] [2019-11-28 20:04:50,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294171496] [2019-11-28 20:04:50,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:50,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:04:50,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:04:50,358 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:50,358 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-28 20:04:50,359 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:50,379 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-28 20:04:50,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:04:50,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-28 20:04:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:50,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:04:50,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-28 20:04:50,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067045224] [2019-11-28 20:04:50,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:04:50,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:50,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:04:50,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:04:50,399 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2019-11-28 20:04:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:50,577 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-11-28 20:04:50,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:04:50,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-28 20:04:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:50,579 INFO L225 Difference]: With dead ends: 74 [2019-11-28 20:04:50,579 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 20:04:50,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:04:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 20:04:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2019-11-28 20:04:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 20:04:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-28 20:04:50,583 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 17 [2019-11-28 20:04:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:50,584 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-28 20:04:50,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:04:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-11-28 20:04:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:04:50,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:50,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:50,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:50,790 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash 168377437, now seen corresponding path program 1 times [2019-11-28 20:04:50,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:50,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196329812] [2019-11-28 20:04:50,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:50,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196329812] [2019-11-28 20:04:50,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:50,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:04:50,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232186884] [2019-11-28 20:04:50,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:04:50,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:50,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:04:50,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:04:50,852 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 7 states. [2019-11-28 20:04:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:51,070 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-11-28 20:04:51,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:04:51,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 20:04:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:51,071 INFO L225 Difference]: With dead ends: 64 [2019-11-28 20:04:51,071 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 20:04:51,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:04:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 20:04:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-28 20:04:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 20:04:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-11-28 20:04:51,075 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 21 [2019-11-28 20:04:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:51,076 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-11-28 20:04:51,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:04:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-11-28 20:04:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:04:51,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:51,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:51,077 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash 168377438, now seen corresponding path program 1 times [2019-11-28 20:04:51,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:51,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585630748] [2019-11-28 20:04:51,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:51,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585630748] [2019-11-28 20:04:51,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:51,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:04:51,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734605190] [2019-11-28 20:04:51,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:04:51,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:04:51,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:04:51,186 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 9 states. [2019-11-28 20:04:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:51,504 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2019-11-28 20:04:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:04:51,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-28 20:04:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:51,506 INFO L225 Difference]: With dead ends: 76 [2019-11-28 20:04:51,506 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 20:04:51,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:04:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 20:04:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-11-28 20:04:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 20:04:51,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-11-28 20:04:51,510 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 21 [2019-11-28 20:04:51,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:51,511 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-11-28 20:04:51,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:04:51,511 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-11-28 20:04:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:04:51,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:51,513 INFO L410 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-11-28 20:04:51,513 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:51,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1415217207, now seen corresponding path program 1 times [2019-11-28 20:04:51,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:51,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075978807] [2019-11-28 20:04:51,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:51,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075978807] [2019-11-28 20:04:51,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:51,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:04:51,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249673186] [2019-11-28 20:04:51,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:51,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:51,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:51,577 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 5 states. [2019-11-28 20:04:51,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:51,687 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-11-28 20:04:51,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:04:51,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 20:04:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:51,688 INFO L225 Difference]: With dead ends: 67 [2019-11-28 20:04:51,688 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 20:04:51,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 20:04:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-28 20:04:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 20:04:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-11-28 20:04:51,692 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 23 [2019-11-28 20:04:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:51,692 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-11-28 20:04:51,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-11-28 20:04:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:04:51,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:51,694 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:51,695 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:51,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:51,695 INFO L82 PathProgramCache]: Analyzing trace with hash 808083893, now seen corresponding path program 1 times [2019-11-28 20:04:51,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:51,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80471922] [2019-11-28 20:04:51,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:51,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80471922] [2019-11-28 20:04:51,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:51,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:04:51,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614938149] [2019-11-28 20:04:51,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:04:51,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:51,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:04:51,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:04:51,740 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 4 states. [2019-11-28 20:04:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:51,822 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-11-28 20:04:51,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:04:51,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-28 20:04:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:51,824 INFO L225 Difference]: With dead ends: 64 [2019-11-28 20:04:51,824 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 20:04:51,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 20:04:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-28 20:04:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 20:04:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-28 20:04:51,829 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 25 [2019-11-28 20:04:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:51,829 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-28 20:04:51,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:04:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-11-28 20:04:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:04:51,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:51,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:51,831 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:51,832 INFO L82 PathProgramCache]: Analyzing trace with hash -826319086, now seen corresponding path program 1 times [2019-11-28 20:04:51,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:51,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875444529] [2019-11-28 20:04:51,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:52,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875444529] [2019-11-28 20:04:52,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:52,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:04:52,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345408893] [2019-11-28 20:04:52,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:04:52,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:52,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:04:52,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:04:52,030 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 9 states. [2019-11-28 20:04:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:52,334 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2019-11-28 20:04:52,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:04:52,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-28 20:04:52,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:52,336 INFO L225 Difference]: With dead ends: 77 [2019-11-28 20:04:52,336 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 20:04:52,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:04:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 20:04:52,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-28 20:04:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 20:04:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-11-28 20:04:52,343 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 27 [2019-11-28 20:04:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:52,343 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-11-28 20:04:52,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:04:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-11-28 20:04:52,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:04:52,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:52,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:52,344 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:52,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:52,344 INFO L82 PathProgramCache]: Analyzing trace with hash -403617260, now seen corresponding path program 1 times [2019-11-28 20:04:52,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:52,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445208740] [2019-11-28 20:04:52,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:52,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445208740] [2019-11-28 20:04:52,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:52,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 20:04:52,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659793857] [2019-11-28 20:04:52,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:04:52,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:52,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:04:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:04:52,605 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 10 states. [2019-11-28 20:04:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:52,891 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-11-28 20:04:52,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:04:52,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-28 20:04:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:52,892 INFO L225 Difference]: With dead ends: 80 [2019-11-28 20:04:52,893 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 20:04:52,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:04:52,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 20:04:52,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-11-28 20:04:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 20:04:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-11-28 20:04:52,896 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 27 [2019-11-28 20:04:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:52,896 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-11-28 20:04:52,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:04:52,896 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2019-11-28 20:04:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 20:04:52,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:52,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:52,897 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:52,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:52,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1843673559, now seen corresponding path program 1 times [2019-11-28 20:04:52,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:52,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377385066] [2019-11-28 20:04:52,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:53,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377385066] [2019-11-28 20:04:53,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:53,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 20:04:53,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960318593] [2019-11-28 20:04:53,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:04:53,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:53,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:04:53,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:04:53,043 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 11 states. [2019-11-28 20:04:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:53,377 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2019-11-28 20:04:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:04:53,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-11-28 20:04:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:53,378 INFO L225 Difference]: With dead ends: 81 [2019-11-28 20:04:53,379 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 20:04:53,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:04:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 20:04:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-11-28 20:04:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 20:04:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-11-28 20:04:53,382 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 31 [2019-11-28 20:04:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:53,383 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-11-28 20:04:53,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:04:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-11-28 20:04:53,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 20:04:53,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:53,384 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:53,384 INFO L410 AbstractCegarLoop]: === Iteration 20 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:53,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:53,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1709660053, now seen corresponding path program 1 times [2019-11-28 20:04:53,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:53,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303915368] [2019-11-28 20:04:53,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:53,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303915368] [2019-11-28 20:04:53,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:53,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 20:04:53,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791331667] [2019-11-28 20:04:53,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:04:53,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:53,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:04:53,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:04:53,584 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 13 states. [2019-11-28 20:04:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:53,953 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2019-11-28 20:04:53,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:04:53,953 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-11-28 20:04:53,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:53,955 INFO L225 Difference]: With dead ends: 103 [2019-11-28 20:04:53,955 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 20:04:53,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:04:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 20:04:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2019-11-28 20:04:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 20:04:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2019-11-28 20:04:53,959 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 31 [2019-11-28 20:04:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:53,960 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2019-11-28 20:04:53,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:04:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2019-11-28 20:04:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:04:53,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:53,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:53,961 INFO L410 AbstractCegarLoop]: === Iteration 21 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:53,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:53,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1499760060, now seen corresponding path program 1 times [2019-11-28 20:04:53,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:53,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063063666] [2019-11-28 20:04:53,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:54,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063063666] [2019-11-28 20:04:54,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:54,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 20:04:54,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872948612] [2019-11-28 20:04:54,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:04:54,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:54,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:04:54,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:04:54,056 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 11 states. [2019-11-28 20:04:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:54,487 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-11-28 20:04:54,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:04:54,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-11-28 20:04:54,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:54,488 INFO L225 Difference]: With dead ends: 81 [2019-11-28 20:04:54,488 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:04:54,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:04:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:04:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-11-28 20:04:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:04:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-11-28 20:04:54,491 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 32 [2019-11-28 20:04:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:54,492 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-11-28 20:04:54,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:04:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-11-28 20:04:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 20:04:54,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:54,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:54,493 INFO L410 AbstractCegarLoop]: === Iteration 22 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:54,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:54,494 INFO L82 PathProgramCache]: Analyzing trace with hash 385012248, now seen corresponding path program 1 times [2019-11-28 20:04:54,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:54,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228902841] [2019-11-28 20:04:54,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:54,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228902841] [2019-11-28 20:04:54,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21347170] [2019-11-28 20:04:54,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:54,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 20:04:54,734 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:04:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:54,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:04:54,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-28 20:04:54,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515096062] [2019-11-28 20:04:54,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 20:04:54,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:54,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 20:04:54,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:04:54,890 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 18 states. [2019-11-28 20:04:55,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:55,407 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-11-28 20:04:55,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:04:55,408 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-11-28 20:04:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:55,408 INFO L225 Difference]: With dead ends: 73 [2019-11-28 20:04:55,409 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 20:04:55,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-11-28 20:04:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 20:04:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2019-11-28 20:04:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 20:04:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-11-28 20:04:55,414 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 35 [2019-11-28 20:04:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:55,415 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-11-28 20:04:55,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 20:04:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-11-28 20:04:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 20:04:55,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:55,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:55,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:55,640 INFO L410 AbstractCegarLoop]: === Iteration 23 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:55,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1958963042, now seen corresponding path program 1 times [2019-11-28 20:04:55,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:55,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483988609] [2019-11-28 20:04:55,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:55,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483988609] [2019-11-28 20:04:55,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454168534] [2019-11-28 20:04:55,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:55,851 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 20:04:55,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:04:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:55,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:04:55,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-28 20:04:55,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814765065] [2019-11-28 20:04:55,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 20:04:55,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:55,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 20:04:55,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:04:55,973 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 16 states. [2019-11-28 20:04:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:56,379 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2019-11-28 20:04:56,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:04:56,380 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-11-28 20:04:56,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:56,381 INFO L225 Difference]: With dead ends: 119 [2019-11-28 20:04:56,381 INFO L226 Difference]: Without dead ends: 119 [2019-11-28 20:04:56,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:04:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-28 20:04:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2019-11-28 20:04:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 20:04:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-11-28 20:04:56,385 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 38 [2019-11-28 20:04:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:56,385 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-11-28 20:04:56,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 20:04:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-11-28 20:04:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 20:04:56,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:56,386 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:56,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:56,594 INFO L410 AbstractCegarLoop]: === Iteration 24 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:56,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:56,594 INFO L82 PathProgramCache]: Analyzing trace with hash 950813004, now seen corresponding path program 2 times [2019-11-28 20:04:56,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:56,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440583994] [2019-11-28 20:04:56,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:56,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440583994] [2019-11-28 20:04:56,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317971427] [2019-11-28 20:04:56,917 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:57,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:04:57,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:04:57,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 20:04:57,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:04:57,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-28 20:04:57,114 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:57,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:57,122 INFO L534 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-11-28 20:04:57,122 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-28 20:04:57,319 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:57,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2019-11-28 20:04:57,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 20:04:57,331 INFO L614 ElimStorePlain]: treesize reduction 8, result has 55.6 percent of original size [2019-11-28 20:04:57,332 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:04:57,333 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:3 [2019-11-28 20:04:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:57,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:04:57,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-11-28 20:04:57,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872372375] [2019-11-28 20:04:57,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 20:04:57,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:57,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 20:04:57,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-11-28 20:04:57,380 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 26 states. [2019-11-28 20:04:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:58,275 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2019-11-28 20:04:58,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 20:04:58,276 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 41 [2019-11-28 20:04:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:58,277 INFO L225 Difference]: With dead ends: 134 [2019-11-28 20:04:58,277 INFO L226 Difference]: Without dead ends: 128 [2019-11-28 20:04:58,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2019-11-28 20:04:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-28 20:04:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2019-11-28 20:04:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 20:04:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2019-11-28 20:04:58,283 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 41 [2019-11-28 20:04:58,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:58,283 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2019-11-28 20:04:58,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 20:04:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2019-11-28 20:04:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 20:04:58,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:58,285 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:58,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:58,488 INFO L410 AbstractCegarLoop]: === Iteration 25 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:04:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2043759601, now seen corresponding path program 3 times [2019-11-28 20:04:58,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:58,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129981014] [2019-11-28 20:04:58,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:04:58,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129981014] [2019-11-28 20:04:58,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201433835] [2019-11-28 20:04:58,657 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:58,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 20:04:58,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:04:58,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 20:04:58,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:04:58,798 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:58,799 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-28 20:04:58,799 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:58,817 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-28 20:04:58,818 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:04:58,818 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-28 20:04:58,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-28 20:04:58,838 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:58,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:58,843 INFO L534 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-11-28 20:04:58,844 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-11-28 20:04:58,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:58,970 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-11-28 20:04:58,971 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 20:04:58,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:58,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:04:58,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-28 20:04:58,983 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-11-28 20:04:59,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:04:59,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:04:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 20:04:59,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:04:59,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-11-28 20:04:59,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677503824] [2019-11-28 20:04:59,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 20:04:59,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:59,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 20:04:59,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:04:59,154 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 23 states. [2019-11-28 20:05:00,626 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-11-28 20:05:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:05:00,900 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-11-28 20:05:00,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 20:05:00,902 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-11-28 20:05:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:05:00,903 INFO L225 Difference]: With dead ends: 142 [2019-11-28 20:05:00,903 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 20:05:00,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=306, Invalid=1334, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 20:05:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 20:05:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 92. [2019-11-28 20:05:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 20:05:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-11-28 20:05:00,908 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 45 [2019-11-28 20:05:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:05:00,909 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-11-28 20:05:00,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 20:05:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-11-28 20:05:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 20:05:00,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:05:00,910 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:05:01,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:05:01,119 INFO L410 AbstractCegarLoop]: === Iteration 26 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:05:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:05:01,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1906876194, now seen corresponding path program 2 times [2019-11-28 20:05:01,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:05:01,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574502615] [2019-11-28 20:05:01,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:05:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:05:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:05:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:05:01,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574502615] [2019-11-28 20:05:01,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907966933] [2019-11-28 20:05:01,494 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:05:01,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:05:01,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:05:01,607 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-28 20:05:01,611 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:05:01,619 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-28 20:05:01,619 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:05:01,625 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:05:01,626 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:05:01,626 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-28 20:05:01,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 14 treesize of output 10 [2019-11-28 20:05:01,716 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:05:01,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:05:01,725 INFO L534 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-11-28 20:05:01,725 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-28 20:05:01,758 INFO L377 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 25 treesize of output 24 [2019-11-28 20:05:01,759 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:05:01,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:05:01,773 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:05:01,774 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2019-11-28 20:05:02,485 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:05:02,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 38 [2019-11-28 20:05:02,486 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:05:02,509 INFO L614 ElimStorePlain]: treesize reduction 12, result has 66.7 percent of original size [2019-11-28 20:05:02,511 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:05:02,511 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:8 [2019-11-28 20:05:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:05:02,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:05:02,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 29 [2019-11-28 20:05:02,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515784165] [2019-11-28 20:05:02,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 20:05:02,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:05:02,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 20:05:02,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2019-11-28 20:05:02,569 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 29 states. [2019-11-28 20:05:03,907 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-11-28 20:05:04,080 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-11-28 20:05:04,766 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-11-28 20:05:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:05:05,386 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2019-11-28 20:05:05,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 20:05:05,387 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2019-11-28 20:05:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:05:05,388 INFO L225 Difference]: With dead ends: 158 [2019-11-28 20:05:05,388 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 20:05:05,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=281, Invalid=2071, Unknown=0, NotChecked=0, Total=2352 [2019-11-28 20:05:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 20:05:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-11-28 20:05:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 20:05:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2019-11-28 20:05:05,394 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 51 [2019-11-28 20:05:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:05:05,394 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2019-11-28 20:05:05,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 20:05:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2019-11-28 20:05:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-28 20:05:05,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:05:05,396 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:05:05,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:05:05,603 INFO L410 AbstractCegarLoop]: === Iteration 27 === [cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 20:05:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:05:05,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1800116063, now seen corresponding path program 3 times [2019-11-28 20:05:05,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:05:05,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922528241] [2019-11-28 20:05:05,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:05:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:05:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:05:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:05:05,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922528241] [2019-11-28 20:05:05,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116725334] [2019-11-28 20:05:05,760 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:05:05,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 20:05:05,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:05:05,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-28 20:05:05,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:05:05,953 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-28 20:05:05,954 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:05:05,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:05:05,959 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:05:05,959 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-28 20:05:06,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 14 treesize of output 10 [2019-11-28 20:05:06,018 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:05:06,029 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:05:06,030 INFO L534 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-11-28 20:05:06,030 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-11-28 20:05:06,086 INFO L377 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 25 treesize of output 24 [2019-11-28 20:05:06,087 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:05:06,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:05:06,105 INFO L534 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-11-28 20:05:06,105 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-11-28 20:05:07,352 WARN L192 SmtUtils]: Spent 743.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-28 20:05:07,480 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:05:07,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 70 [2019-11-28 20:05:07,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:05:07,564 INFO L614 ElimStorePlain]: treesize reduction 6, result has 92.5 percent of original size [2019-11-28 20:05:07,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:05:07,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:05:07,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:05:07,586 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:65, output treesize:66 [2019-11-28 20:05:07,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:05:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:05:07,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:05:07,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2019-11-28 20:05:07,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808927708] [2019-11-28 20:05:07,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 20:05:07,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:05:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 20:05:07,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2019-11-28 20:05:07,744 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 27 states. [2019-11-28 20:05:09,568 WARN L192 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-28 20:05:11,512 WARN L192 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-11-28 20:05:11,789 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-11-28 20:05:12,062 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-11-28 20:05:12,852 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-11-28 20:05:13,360 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-11-28 20:05:15,062 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-11-28 20:05:21,248 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-11-28 20:05:22,129 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-11-28 20:05:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:05:22,173 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-11-28 20:05:22,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-28 20:05:22,174 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2019-11-28 20:05:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:05:22,174 INFO L225 Difference]: With dead ends: 114 [2019-11-28 20:05:22,174 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:05:22,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=517, Invalid=3388, Unknown=1, NotChecked=0, Total=3906 [2019-11-28 20:05:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:05:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:05:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:05:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:05:22,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2019-11-28 20:05:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:05:22,176 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:05:22,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 20:05:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:05:22,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:05:22,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:05:22,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:05:22 BoogieIcfgContainer [2019-11-28 20:05:22,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:05:22,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:05:22,385 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:05:22,385 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:05:22,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:04:45" (3/4) ... [2019-11-28 20:05:22,390 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:05:22,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:05:22,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2019-11-28 20:05:22,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-28 20:05:22,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-28 20:05:22,399 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-28 20:05:22,399 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-28 20:05:22,399 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:05:22,399 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-28 20:05:22,405 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-28 20:05:22,406 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-28 20:05:22,406 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:05:22,406 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:05:22,461 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:05:22,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:05:22,463 INFO L168 Benchmark]: Toolchain (without parser) took 37953.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 449.3 MB). Free memory was 957.7 MB in the beginning and 954.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 452.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:05:22,463 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:05:22,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:05:22,464 INFO L168 Benchmark]: Boogie Preprocessor took 62.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:05:22,465 INFO L168 Benchmark]: RCFGBuilder took 681.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:05:22,465 INFO L168 Benchmark]: TraceAbstraction took 36463.35 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.3 MB). Free memory was 1.0 GB in the beginning and 955.6 MB in the end (delta: 93.0 MB). Peak memory consumption was 412.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:05:22,466 INFO L168 Benchmark]: Witness Printer took 76.73 ms. Allocated memory is still 1.5 GB. Free memory was 955.6 MB in the beginning and 954.8 MB in the end (delta: 757.5 kB). Peak memory consumption was 757.5 kB. Max. memory is 11.5 GB. [2019-11-28 20:05:22,468 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 663.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 681.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36463.35 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.3 MB). Free memory was 1.0 GB in the beginning and 955.6 MB in the end (delta: 93.0 MB). Peak memory consumption was 412.3 MB. Max. memory is 11.5 GB. * Witness Printer took 76.73 ms. Allocated memory is still 1.5 GB. Free memory was 955.6 MB in the beginning and 954.8 MB in the end (delta: 757.5 kB). Peak memory consumption was 757.5 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 77 locations, 19 error locations. Result: SAFE, OverallTime: 36.3s, OverallIterations: 27, TraceHistogramMax: 2, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 978 SDtfs, 2806 SDslu, 1584 SDs, 0 SdLazy, 6383 SolverSat, 358 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 689 GetRequests, 285 SyntacticMatches, 11 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 20.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 249 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 965 NumberOfCodeBlocks, 965 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 930 ConstructedInterpolants, 80 QuantifiedInterpolants, 338164 SizeOfPredicates, 86 NumberOfNonLiveVariables, 1301 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 35 InterpolantComputations, 19 PerfectInterpolantSequences, 70/157 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...