./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0521.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/memsafety/test-0521.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 55e080b379cbe2b1b2a29d34ca4914126366bc9d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/memsafety/test-0521.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 55e080b379cbe2b1b2a29d34ca4914126366bc9d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 05:32:07,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 05:32:07,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 05:32:07,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 05:32:07,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 05:32:07,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 05:32:07,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 05:32:07,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 05:32:07,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 05:32:07,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 05:32:07,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 05:32:07,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 05:32:07,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 05:32:07,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 05:32:07,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 05:32:07,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 05:32:07,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 05:32:07,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 05:32:07,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 05:32:07,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 05:32:07,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 05:32:07,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 05:32:07,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 05:32:07,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 05:32:07,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 05:32:07,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 05:32:07,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 05:32:07,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 05:32:07,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 05:32:07,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 05:32:07,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 05:32:07,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 05:32:07,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 05:32:07,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 05:32:07,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 05:32:07,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 05:32:07,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 05:32:07,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 05:32:07,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 05:32:07,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 05:32:07,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 05:32:07,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 05:32:07,289 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 05:32:07,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 05:32:07,289 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 05:32:07,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 05:32:07,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 05:32:07,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 05:32:07,291 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 05:32:07,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 05:32:07,291 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 05:32:07,291 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 05:32:07,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 05:32:07,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 05:32:07,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 05:32:07,292 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 05:32:07,292 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 05:32:07,292 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 05:32:07,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 05:32:07,293 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 05:32:07,293 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 05:32:07,293 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 05:32:07,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 05:32:07,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 05:32:07,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 05:32:07,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:32:07,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 05:32:07,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 05:32:07,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 05:32:07,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 05:32:07,294 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 05:32:07,295 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 55e080b379cbe2b1b2a29d34ca4914126366bc9d [2021-08-27 05:32:07,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 05:32:07,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 05:32:07,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 05:32:07,539 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 05:32:07,544 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 05:32:07,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0521.i [2021-08-27 05:32:07,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94991e16/b205b2ee53e8427caa1012cbd742f3f5/FLAGbff34a639 [2021-08-27 05:32:08,000 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 05:32:08,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2021-08-27 05:32:08,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94991e16/b205b2ee53e8427caa1012cbd742f3f5/FLAGbff34a639 [2021-08-27 05:32:08,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94991e16/b205b2ee53e8427caa1012cbd742f3f5 [2021-08-27 05:32:08,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 05:32:08,028 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 05:32:08,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 05:32:08,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 05:32:08,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 05:32:08,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:32:08" (1/1) ... [2021-08-27 05:32:08,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21853605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:32:08, skipping insertion in model container [2021-08-27 05:32:08,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:32:08" (1/1) ... [2021-08-27 05:32:08,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 05:32:08,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 05:32:08,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:32:08,310 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 05:32:08,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:32:08,406 INFO L208 MainTranslator]: Completed translation [2021-08-27 05:32:08,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:32:08 WrapperNode [2021-08-27 05:32:08,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 05:32:08,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 05:32:08,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 05:32:08,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 05:32:08,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:32:08" (1/1) ... [2021-08-27 05:32:08,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:32:08" (1/1) ... [2021-08-27 05:32:08,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:32:08" (1/1) ... [2021-08-27 05:32:08,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:32:08" (1/1) ... [2021-08-27 05:32:08,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:32:08" (1/1) ... [2021-08-27 05:32:08,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:32:08" (1/1) ... [2021-08-27 05:32:08,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:32:08" (1/1) ... [2021-08-27 05:32:08,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 05:32:08,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 05:32:08,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 05:32:08,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 05:32:08,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:32:08" (1/1) ... [2021-08-27 05:32:08,498 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:32:08,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:32:08,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 05:32:08,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 05:32:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 05:32:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 05:32:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 05:32:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 05:32:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 05:32:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 05:32:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 05:32:08,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 05:32:08,553 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 05:32:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 05:32:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 05:32:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 05:32:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 05:32:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 05:32:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 05:32:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 05:32:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 05:32:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 05:32:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 05:32:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 05:32:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 05:32:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 05:32:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 05:32:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 05:32:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 05:32:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 05:32:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 05:32:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 05:32:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 05:32:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 05:32:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 05:32:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 05:32:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 05:32:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 05:32:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 05:32:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 05:32:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 05:32:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 05:32:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 05:32:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 05:32:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 05:32:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 05:32:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 05:32:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 05:32:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 05:32:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 05:32:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 05:32:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 05:32:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 05:32:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 05:32:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 05:32:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 05:32:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 05:32:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 05:32:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 05:32:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 05:32:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 05:32:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 05:32:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 05:32:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 05:32:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 05:32:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 05:32:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 05:32:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 05:32:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 05:32:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 05:32:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 05:32:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 05:32:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 05:32:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 05:32:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 05:32:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 05:32:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 05:32:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 05:32:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 05:32:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 05:32:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 05:32:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 05:32:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 05:32:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 05:32:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 05:32:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 05:32:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 05:32:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 05:32:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 05:32:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 05:32:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 05:32:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 05:32:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 05:32:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 05:32:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 05:32:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 05:32:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 05:32:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 05:32:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 05:32:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 05:32:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 05:32:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 05:32:08,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 05:32:08,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 05:32:08,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 05:32:08,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 05:32:08,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 05:32:08,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 05:32:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 05:32:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 05:32:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 05:32:09,407 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 05:32:09,408 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-27 05:32:09,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:32:09 BoogieIcfgContainer [2021-08-27 05:32:09,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 05:32:09,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 05:32:09,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 05:32:09,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 05:32:09,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 05:32:08" (1/3) ... [2021-08-27 05:32:09,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362a0411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:32:09, skipping insertion in model container [2021-08-27 05:32:09,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:32:08" (2/3) ... [2021-08-27 05:32:09,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362a0411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:32:09, skipping insertion in model container [2021-08-27 05:32:09,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:32:09" (3/3) ... [2021-08-27 05:32:09,423 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0521.i [2021-08-27 05:32:09,426 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 05:32:09,427 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2021-08-27 05:32:09,456 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 05:32:09,460 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 05:32:09,460 INFO L340 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2021-08-27 05:32:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 318 states, 161 states have (on average 2.1801242236024843) internal successors, (351), 313 states have internal predecessors, (351), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:32:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:32:09,479 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:09,479 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:09,480 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1573389995, now seen corresponding path program 1 times [2021-08-27 05:32:09,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:09,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880059529] [2021-08-27 05:32:09,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:09,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:09,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:09,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:09,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880059529] [2021-08-27 05:32:09,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880059529] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:09,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:09,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:32:09,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634364008] [2021-08-27 05:32:09,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:32:09,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:32:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:32:09,672 INFO L87 Difference]: Start difference. First operand has 318 states, 161 states have (on average 2.1801242236024843) internal successors, (351), 313 states have internal predecessors, (351), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:10,105 INFO L93 Difference]: Finished difference Result 321 states and 349 transitions. [2021-08-27 05:32:10,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:32:10,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 05:32:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:10,118 INFO L225 Difference]: With dead ends: 321 [2021-08-27 05:32:10,118 INFO L226 Difference]: Without dead ends: 318 [2021-08-27 05:32:10,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:32:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-08-27 05:32:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 315. [2021-08-27 05:32:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 160 states have (on average 2.11875) internal successors, (339), 311 states have internal predecessors, (339), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 342 transitions. [2021-08-27 05:32:10,182 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 342 transitions. Word has length 9 [2021-08-27 05:32:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:10,182 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 342 transitions. [2021-08-27 05:32:10,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 342 transitions. [2021-08-27 05:32:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:32:10,182 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:10,182 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:10,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 05:32:10,183 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:10,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:10,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1531494200, now seen corresponding path program 1 times [2021-08-27 05:32:10,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:10,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082922063] [2021-08-27 05:32:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:10,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:10,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:10,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:10,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082922063] [2021-08-27 05:32:10,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082922063] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:10,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:10,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:32:10,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442218675] [2021-08-27 05:32:10,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:32:10,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:10,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:32:10,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:10,281 INFO L87 Difference]: Start difference. First operand 315 states and 342 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:10,700 INFO L93 Difference]: Finished difference Result 302 states and 330 transitions. [2021-08-27 05:32:10,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:32:10,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 05:32:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:10,701 INFO L225 Difference]: With dead ends: 302 [2021-08-27 05:32:10,701 INFO L226 Difference]: Without dead ends: 302 [2021-08-27 05:32:10,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-08-27 05:32:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2021-08-27 05:32:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 160 states have (on average 2.01875) internal successors, (323), 295 states have internal predecessors, (323), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 326 transitions. [2021-08-27 05:32:10,708 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 326 transitions. Word has length 10 [2021-08-27 05:32:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:10,708 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 326 transitions. [2021-08-27 05:32:10,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 326 transitions. [2021-08-27 05:32:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:32:10,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:10,708 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:10,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 05:32:10,708 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:10,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1531494199, now seen corresponding path program 1 times [2021-08-27 05:32:10,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:10,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092059350] [2021-08-27 05:32:10,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:10,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:10,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:10,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:10,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092059350] [2021-08-27 05:32:10,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092059350] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:10,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:10,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:32:10,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478720005] [2021-08-27 05:32:10,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:32:10,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:10,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:32:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:10,760 INFO L87 Difference]: Start difference. First operand 299 states and 326 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:11,132 INFO L93 Difference]: Finished difference Result 286 states and 314 transitions. [2021-08-27 05:32:11,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:32:11,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 05:32:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:11,133 INFO L225 Difference]: With dead ends: 286 [2021-08-27 05:32:11,133 INFO L226 Difference]: Without dead ends: 286 [2021-08-27 05:32:11,134 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-08-27 05:32:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2021-08-27 05:32:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 160 states have (on average 1.91875) internal successors, (307), 279 states have internal predecessors, (307), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 310 transitions. [2021-08-27 05:32:11,137 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 310 transitions. Word has length 10 [2021-08-27 05:32:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:11,137 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 310 transitions. [2021-08-27 05:32:11,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 310 transitions. [2021-08-27 05:32:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:32:11,137 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:11,138 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:11,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 05:32:11,138 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:11,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:11,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1531493109, now seen corresponding path program 1 times [2021-08-27 05:32:11,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:11,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877648933] [2021-08-27 05:32:11,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:11,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:11,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:11,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:11,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877648933] [2021-08-27 05:32:11,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877648933] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:11,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:11,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:32:11,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101775078] [2021-08-27 05:32:11,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:32:11,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:32:11,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:11,172 INFO L87 Difference]: Start difference. First operand 283 states and 310 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:11,646 INFO L93 Difference]: Finished difference Result 338 states and 374 transitions. [2021-08-27 05:32:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:32:11,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 05:32:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:11,654 INFO L225 Difference]: With dead ends: 338 [2021-08-27 05:32:11,654 INFO L226 Difference]: Without dead ends: 338 [2021-08-27 05:32:11,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-08-27 05:32:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 281. [2021-08-27 05:32:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 160 states have (on average 1.90625) internal successors, (305), 277 states have internal predecessors, (305), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 308 transitions. [2021-08-27 05:32:11,658 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 308 transitions. Word has length 10 [2021-08-27 05:32:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:11,658 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 308 transitions. [2021-08-27 05:32:11,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 308 transitions. [2021-08-27 05:32:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:32:11,659 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:11,659 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:11,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 05:32:11,659 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1531493108, now seen corresponding path program 1 times [2021-08-27 05:32:11,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:11,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257251722] [2021-08-27 05:32:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:11,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:11,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:11,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:11,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257251722] [2021-08-27 05:32:11,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257251722] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:11,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:11,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:32:11,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486989779] [2021-08-27 05:32:11,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:32:11,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:11,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:32:11,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:11,732 INFO L87 Difference]: Start difference. First operand 281 states and 308 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:12,367 INFO L93 Difference]: Finished difference Result 470 states and 519 transitions. [2021-08-27 05:32:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:32:12,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 05:32:12,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:12,370 INFO L225 Difference]: With dead ends: 470 [2021-08-27 05:32:12,370 INFO L226 Difference]: Without dead ends: 470 [2021-08-27 05:32:12,370 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-08-27 05:32:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 279. [2021-08-27 05:32:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 160 states have (on average 1.89375) internal successors, (303), 275 states have internal predecessors, (303), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 306 transitions. [2021-08-27 05:32:12,375 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 306 transitions. Word has length 10 [2021-08-27 05:32:12,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:12,375 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 306 transitions. [2021-08-27 05:32:12,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 306 transitions. [2021-08-27 05:32:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 05:32:12,376 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:12,376 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:12,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 05:32:12,376 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:12,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1407857353, now seen corresponding path program 1 times [2021-08-27 05:32:12,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:12,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859717056] [2021-08-27 05:32:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:12,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:12,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:12,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:12,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859717056] [2021-08-27 05:32:12,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859717056] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:12,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:12,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:32:12,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24338424] [2021-08-27 05:32:12,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 05:32:12,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:12,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 05:32:12,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:32:12,427 INFO L87 Difference]: Start difference. First operand 279 states and 306 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:12,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:12,797 INFO L93 Difference]: Finished difference Result 682 states and 751 transitions. [2021-08-27 05:32:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:32:12,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 05:32:12,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:12,800 INFO L225 Difference]: With dead ends: 682 [2021-08-27 05:32:12,800 INFO L226 Difference]: Without dead ends: 682 [2021-08-27 05:32:12,800 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 40.5ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:32:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-08-27 05:32:12,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 284. [2021-08-27 05:32:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 165 states have (on average 1.8727272727272728) internal successors, (309), 280 states have internal predecessors, (309), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 312 transitions. [2021-08-27 05:32:12,806 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 312 transitions. Word has length 12 [2021-08-27 05:32:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:12,807 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 312 transitions. [2021-08-27 05:32:12,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 312 transitions. [2021-08-27 05:32:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 05:32:12,807 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:12,808 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:12,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 05:32:12,808 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:12,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:12,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2028307168, now seen corresponding path program 1 times [2021-08-27 05:32:12,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:12,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333219468] [2021-08-27 05:32:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:12,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:12,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:12,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:12,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333219468] [2021-08-27 05:32:12,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333219468] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:12,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:12,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:32:12,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650514282] [2021-08-27 05:32:12,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:32:12,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:12,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:32:12,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:12,857 INFO L87 Difference]: Start difference. First operand 284 states and 312 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:13,391 INFO L93 Difference]: Finished difference Result 468 states and 516 transitions. [2021-08-27 05:32:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:32:13,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 05:32:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:13,393 INFO L225 Difference]: With dead ends: 468 [2021-08-27 05:32:13,393 INFO L226 Difference]: Without dead ends: 468 [2021-08-27 05:32:13,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-08-27 05:32:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 282. [2021-08-27 05:32:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 165 states have (on average 1.8606060606060606) internal successors, (307), 278 states have internal predecessors, (307), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 310 transitions. [2021-08-27 05:32:13,398 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 310 transitions. Word has length 15 [2021-08-27 05:32:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:13,398 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 310 transitions. [2021-08-27 05:32:13,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 310 transitions. [2021-08-27 05:32:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 05:32:13,399 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:13,399 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:13,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 05:32:13,399 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2028307169, now seen corresponding path program 1 times [2021-08-27 05:32:13,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:13,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698191876] [2021-08-27 05:32:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:13,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:13,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:13,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698191876] [2021-08-27 05:32:13,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698191876] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:13,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:13,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:32:13,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534464980] [2021-08-27 05:32:13,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:32:13,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:32:13,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:13,432 INFO L87 Difference]: Start difference. First operand 282 states and 310 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:13,821 INFO L93 Difference]: Finished difference Result 332 states and 367 transitions. [2021-08-27 05:32:13,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:32:13,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 05:32:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:13,823 INFO L225 Difference]: With dead ends: 332 [2021-08-27 05:32:13,823 INFO L226 Difference]: Without dead ends: 332 [2021-08-27 05:32:13,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-08-27 05:32:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 280. [2021-08-27 05:32:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 165 states have (on average 1.8484848484848484) internal successors, (305), 276 states have internal predecessors, (305), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 308 transitions. [2021-08-27 05:32:13,834 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 308 transitions. Word has length 15 [2021-08-27 05:32:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:13,835 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 308 transitions. [2021-08-27 05:32:13,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 308 transitions. [2021-08-27 05:32:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 05:32:13,835 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:13,836 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:13,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 05:32:13,836 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:13,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:13,836 INFO L82 PathProgramCache]: Analyzing trace with hash 659534212, now seen corresponding path program 1 times [2021-08-27 05:32:13,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:13,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227033681] [2021-08-27 05:32:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:13,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:13,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:13,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:13,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227033681] [2021-08-27 05:32:13,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227033681] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:13,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:13,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 05:32:13,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723537713] [2021-08-27 05:32:13,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 05:32:13,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 05:32:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:32:13,905 INFO L87 Difference]: Start difference. First operand 280 states and 308 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:14,323 INFO L93 Difference]: Finished difference Result 670 states and 739 transitions. [2021-08-27 05:32:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 05:32:14,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 05:32:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:14,326 INFO L225 Difference]: With dead ends: 670 [2021-08-27 05:32:14,326 INFO L226 Difference]: Without dead ends: 670 [2021-08-27 05:32:14,326 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 73.9ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-27 05:32:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-08-27 05:32:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 283. [2021-08-27 05:32:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 168 states have (on average 1.8333333333333333) internal successors, (308), 279 states have internal predecessors, (308), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 311 transitions. [2021-08-27 05:32:14,332 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 311 transitions. Word has length 17 [2021-08-27 05:32:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:14,332 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 311 transitions. [2021-08-27 05:32:14,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 311 transitions. [2021-08-27 05:32:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 05:32:14,333 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:14,333 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:14,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 05:32:14,333 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr54REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1853550630, now seen corresponding path program 1 times [2021-08-27 05:32:14,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:14,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741542875] [2021-08-27 05:32:14,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:14,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:14,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:14,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741542875] [2021-08-27 05:32:14,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741542875] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:14,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:14,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:32:14,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961649092] [2021-08-27 05:32:14,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:32:14,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:14,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:32:14,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:32:14,384 INFO L87 Difference]: Start difference. First operand 283 states and 311 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:14,701 INFO L93 Difference]: Finished difference Result 412 states and 451 transitions. [2021-08-27 05:32:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 05:32:14,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 05:32:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:14,703 INFO L225 Difference]: With dead ends: 412 [2021-08-27 05:32:14,703 INFO L226 Difference]: Without dead ends: 412 [2021-08-27 05:32:14,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 46.9ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:32:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-08-27 05:32:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 347. [2021-08-27 05:32:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 232 states have (on average 1.8793103448275863) internal successors, (436), 343 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 439 transitions. [2021-08-27 05:32:14,708 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 439 transitions. Word has length 19 [2021-08-27 05:32:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:14,708 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 439 transitions. [2021-08-27 05:32:14,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 439 transitions. [2021-08-27 05:32:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 05:32:14,709 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:14,709 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:14,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 05:32:14,709 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:14,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1618754734, now seen corresponding path program 1 times [2021-08-27 05:32:14,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:14,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341103197] [2021-08-27 05:32:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:14,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:14,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:14,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:14,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341103197] [2021-08-27 05:32:14,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341103197] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:14,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:14,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 05:32:14,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159078140] [2021-08-27 05:32:14,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:32:14,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:14,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:32:14,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:14,750 INFO L87 Difference]: Start difference. First operand 347 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:15,012 INFO L93 Difference]: Finished difference Result 332 states and 414 transitions. [2021-08-27 05:32:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:32:15,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 05:32:15,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:15,014 INFO L225 Difference]: With dead ends: 332 [2021-08-27 05:32:15,014 INFO L226 Difference]: Without dead ends: 332 [2021-08-27 05:32:15,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:15,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-08-27 05:32:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2021-08-27 05:32:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 217 states have (on average 1.8940092165898617) internal successors, (411), 328 states have internal predecessors, (411), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 414 transitions. [2021-08-27 05:32:15,019 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 414 transitions. Word has length 20 [2021-08-27 05:32:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:15,020 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 414 transitions. [2021-08-27 05:32:15,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 414 transitions. [2021-08-27 05:32:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 05:32:15,023 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:15,023 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:15,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 05:32:15,024 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr93REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:15,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:15,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1149469566, now seen corresponding path program 1 times [2021-08-27 05:32:15,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:15,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082992085] [2021-08-27 05:32:15,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:15,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:15,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:15,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082992085] [2021-08-27 05:32:15,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082992085] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:15,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:15,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:32:15,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249329691] [2021-08-27 05:32:15,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:32:15,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:15,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:32:15,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:15,068 INFO L87 Difference]: Start difference. First operand 332 states and 414 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:15,381 INFO L93 Difference]: Finished difference Result 316 states and 382 transitions. [2021-08-27 05:32:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:32:15,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 05:32:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:15,383 INFO L225 Difference]: With dead ends: 316 [2021-08-27 05:32:15,383 INFO L226 Difference]: Without dead ends: 316 [2021-08-27 05:32:15,383 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-08-27 05:32:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-08-27 05:32:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 217 states have (on average 1.7465437788018434) internal successors, (379), 312 states have internal predecessors, (379), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 382 transitions. [2021-08-27 05:32:15,388 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 382 transitions. Word has length 21 [2021-08-27 05:32:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:15,389 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 382 transitions. [2021-08-27 05:32:15,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 382 transitions. [2021-08-27 05:32:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 05:32:15,389 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:15,390 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:15,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 05:32:15,390 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr94REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:15,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:15,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1149469567, now seen corresponding path program 1 times [2021-08-27 05:32:15,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:15,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219687480] [2021-08-27 05:32:15,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:15,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:15,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:15,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219687480] [2021-08-27 05:32:15,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219687480] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:15,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:15,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:32:15,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965982321] [2021-08-27 05:32:15,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:32:15,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:15,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:32:15,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:15,434 INFO L87 Difference]: Start difference. First operand 316 states and 382 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:15,787 INFO L93 Difference]: Finished difference Result 300 states and 350 transitions. [2021-08-27 05:32:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:32:15,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 05:32:15,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:15,789 INFO L225 Difference]: With dead ends: 300 [2021-08-27 05:32:15,789 INFO L226 Difference]: Without dead ends: 300 [2021-08-27 05:32:15,789 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:15,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-08-27 05:32:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2021-08-27 05:32:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 217 states have (on average 1.599078341013825) internal successors, (347), 296 states have internal predecessors, (347), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 350 transitions. [2021-08-27 05:32:15,794 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 350 transitions. Word has length 21 [2021-08-27 05:32:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:15,794 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 350 transitions. [2021-08-27 05:32:15,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 350 transitions. [2021-08-27 05:32:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 05:32:15,795 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:15,795 INFO L512 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] [2021-08-27 05:32:15,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 05:32:15,796 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr95REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash 833667807, now seen corresponding path program 1 times [2021-08-27 05:32:15,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:15,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37083406] [2021-08-27 05:32:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:15,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:15,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:15,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:15,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37083406] [2021-08-27 05:32:15,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37083406] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:15,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:15,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:32:15,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367422899] [2021-08-27 05:32:15,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:32:15,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:15,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:32:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:32:15,864 INFO L87 Difference]: Start difference. First operand 300 states and 350 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:16,270 INFO L93 Difference]: Finished difference Result 398 states and 440 transitions. [2021-08-27 05:32:16,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 05:32:16,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 05:32:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:16,272 INFO L225 Difference]: With dead ends: 398 [2021-08-27 05:32:16,272 INFO L226 Difference]: Without dead ends: 398 [2021-08-27 05:32:16,273 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 72.7ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:32:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-08-27 05:32:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 297. [2021-08-27 05:32:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 214 states have (on average 1.5934579439252337) internal successors, (341), 293 states have internal predecessors, (341), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 344 transitions. [2021-08-27 05:32:16,278 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 344 transitions. Word has length 23 [2021-08-27 05:32:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:16,278 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 344 transitions. [2021-08-27 05:32:16,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 344 transitions. [2021-08-27 05:32:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 05:32:16,279 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:16,280 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:16,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 05:32:16,280 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:16,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:16,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1538226823, now seen corresponding path program 1 times [2021-08-27 05:32:16,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:16,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490477363] [2021-08-27 05:32:16,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:16,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:16,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:16,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:16,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:16,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490477363] [2021-08-27 05:32:16,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490477363] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:16,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:16,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:32:16,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288447469] [2021-08-27 05:32:16,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 05:32:16,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:16,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 05:32:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:32:16,357 INFO L87 Difference]: Start difference. First operand 297 states and 344 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:16,775 INFO L93 Difference]: Finished difference Result 320 states and 368 transitions. [2021-08-27 05:32:16,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:32:16,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 05:32:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:16,776 INFO L225 Difference]: With dead ends: 320 [2021-08-27 05:32:16,776 INFO L226 Difference]: Without dead ends: 320 [2021-08-27 05:32:16,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.7ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:32:16,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-08-27 05:32:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 299. [2021-08-27 05:32:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 218 states have (on average 1.5871559633027523) internal successors, (346), 295 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 349 transitions. [2021-08-27 05:32:16,781 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 349 transitions. Word has length 23 [2021-08-27 05:32:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:16,781 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 349 transitions. [2021-08-27 05:32:16,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 349 transitions. [2021-08-27 05:32:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 05:32:16,781 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:16,782 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:16,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 05:32:16,782 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:16,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1538226824, now seen corresponding path program 1 times [2021-08-27 05:32:16,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:16,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528164178] [2021-08-27 05:32:16,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:16,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:16,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:16,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:16,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528164178] [2021-08-27 05:32:16,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528164178] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:16,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:16,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:32:16,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424757825] [2021-08-27 05:32:16,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 05:32:16,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:16,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 05:32:16,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:32:16,852 INFO L87 Difference]: Start difference. First operand 299 states and 349 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:17,393 INFO L93 Difference]: Finished difference Result 413 states and 479 transitions. [2021-08-27 05:32:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:32:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 05:32:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:17,394 INFO L225 Difference]: With dead ends: 413 [2021-08-27 05:32:17,394 INFO L226 Difference]: Without dead ends: 413 [2021-08-27 05:32:17,395 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 58.5ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:32:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-08-27 05:32:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 298. [2021-08-27 05:32:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.5825688073394495) internal successors, (345), 294 states have internal predecessors, (345), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 348 transitions. [2021-08-27 05:32:17,398 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 348 transitions. Word has length 23 [2021-08-27 05:32:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:17,399 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 348 transitions. [2021-08-27 05:32:17,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 348 transitions. [2021-08-27 05:32:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 05:32:17,399 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:17,399 INFO L512 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] [2021-08-27 05:32:17,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 05:32:17,399 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr103REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash -460559739, now seen corresponding path program 1 times [2021-08-27 05:32:17,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:17,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774089754] [2021-08-27 05:32:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:17,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:17,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:17,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:17,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774089754] [2021-08-27 05:32:17,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774089754] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:17,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:17,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:32:17,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737293509] [2021-08-27 05:32:17,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:32:17,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:32:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:32:17,491 INFO L87 Difference]: Start difference. First operand 298 states and 348 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:17,890 INFO L93 Difference]: Finished difference Result 398 states and 446 transitions. [2021-08-27 05:32:17,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 05:32:17,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 05:32:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:17,892 INFO L225 Difference]: With dead ends: 398 [2021-08-27 05:32:17,892 INFO L226 Difference]: Without dead ends: 398 [2021-08-27 05:32:17,892 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 104.0ms TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-08-27 05:32:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-08-27 05:32:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 284. [2021-08-27 05:32:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 204 states have (on average 1.5784313725490196) internal successors, (322), 280 states have internal predecessors, (322), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 325 transitions. [2021-08-27 05:32:17,896 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 325 transitions. Word has length 28 [2021-08-27 05:32:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:17,896 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 325 transitions. [2021-08-27 05:32:17,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 325 transitions. [2021-08-27 05:32:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 05:32:17,897 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:17,897 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 05:32:17,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 05:32:17,897 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:17,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:17,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1627942778, now seen corresponding path program 1 times [2021-08-27 05:32:17,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:17,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151556532] [2021-08-27 05:32:17,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:17,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:17,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:17,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151556532] [2021-08-27 05:32:17,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151556532] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:17,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:17,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:32:17,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058696775] [2021-08-27 05:32:17,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:32:17,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:17,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:32:17,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:32:17,939 INFO L87 Difference]: Start difference. First operand 284 states and 325 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:18,260 INFO L93 Difference]: Finished difference Result 302 states and 335 transitions. [2021-08-27 05:32:18,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:32:18,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 05:32:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:18,261 INFO L225 Difference]: With dead ends: 302 [2021-08-27 05:32:18,262 INFO L226 Difference]: Without dead ends: 302 [2021-08-27 05:32:18,262 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.3ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:32:18,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-08-27 05:32:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 284. [2021-08-27 05:32:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 204 states have (on average 1.5735294117647058) internal successors, (321), 280 states have internal predecessors, (321), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 324 transitions. [2021-08-27 05:32:18,265 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 324 transitions. Word has length 28 [2021-08-27 05:32:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:18,266 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 324 transitions. [2021-08-27 05:32:18,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 324 transitions. [2021-08-27 05:32:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 05:32:18,266 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:18,266 INFO L512 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] [2021-08-27 05:32:18,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 05:32:18,267 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr151ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:18,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash -227034083, now seen corresponding path program 1 times [2021-08-27 05:32:18,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:18,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165426124] [2021-08-27 05:32:18,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:18,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:18,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:18,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:18,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165426124] [2021-08-27 05:32:18,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165426124] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:18,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:18,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:32:18,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886260888] [2021-08-27 05:32:18,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:32:18,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:18,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:32:18,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:32:18,313 INFO L87 Difference]: Start difference. First operand 284 states and 324 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:18,528 INFO L93 Difference]: Finished difference Result 292 states and 325 transitions. [2021-08-27 05:32:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:32:18,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 05:32:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:18,530 INFO L225 Difference]: With dead ends: 292 [2021-08-27 05:32:18,530 INFO L226 Difference]: Without dead ends: 288 [2021-08-27 05:32:18,530 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:32:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-08-27 05:32:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2021-08-27 05:32:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 202 states have (on average 1.5742574257425743) internal successors, (318), 278 states have internal predecessors, (318), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 321 transitions. [2021-08-27 05:32:18,533 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 321 transitions. Word has length 30 [2021-08-27 05:32:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:18,534 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 321 transitions. [2021-08-27 05:32:18,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 321 transitions. [2021-08-27 05:32:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 05:32:18,534 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:18,534 INFO L512 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] [2021-08-27 05:32:18,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 05:32:18,535 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr123REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:18,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:18,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1558517992, now seen corresponding path program 1 times [2021-08-27 05:32:18,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:18,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426391724] [2021-08-27 05:32:18,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:18,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:18,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:18,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426391724] [2021-08-27 05:32:18,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426391724] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:18,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:18,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 05:32:18,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756904584] [2021-08-27 05:32:18,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:32:18,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:18,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:32:18,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:18,573 INFO L87 Difference]: Start difference. First operand 282 states and 321 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:18,788 INFO L93 Difference]: Finished difference Result 267 states and 296 transitions. [2021-08-27 05:32:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:32:18,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 05:32:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:18,789 INFO L225 Difference]: With dead ends: 267 [2021-08-27 05:32:18,789 INFO L226 Difference]: Without dead ends: 249 [2021-08-27 05:32:18,789 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:32:18,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-08-27 05:32:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2021-08-27 05:32:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 245 states have internal predecessors, (275), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 278 transitions. [2021-08-27 05:32:18,792 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 278 transitions. Word has length 31 [2021-08-27 05:32:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:18,793 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 278 transitions. [2021-08-27 05:32:18,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 278 transitions. [2021-08-27 05:32:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 05:32:18,793 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:18,793 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 05:32:18,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 05:32:18,794 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash 5095341, now seen corresponding path program 1 times [2021-08-27 05:32:18,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:18,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375373441] [2021-08-27 05:32:18,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:18,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:18,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:18,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:18,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375373441] [2021-08-27 05:32:18,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375373441] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:18,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:18,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 05:32:18,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015684199] [2021-08-27 05:32:18,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 05:32:18,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:18,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 05:32:18,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:32:18,950 INFO L87 Difference]: Start difference. First operand 249 states and 278 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:19,713 INFO L93 Difference]: Finished difference Result 255 states and 284 transitions. [2021-08-27 05:32:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 05:32:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 05:32:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:19,714 INFO L225 Difference]: With dead ends: 255 [2021-08-27 05:32:19,714 INFO L226 Difference]: Without dead ends: 255 [2021-08-27 05:32:19,714 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 194.2ms TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-08-27 05:32:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-08-27 05:32:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 248. [2021-08-27 05:32:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 169 states have (on average 1.621301775147929) internal successors, (274), 244 states have internal predecessors, (274), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 277 transitions. [2021-08-27 05:32:19,718 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 277 transitions. Word has length 31 [2021-08-27 05:32:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:19,720 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 277 transitions. [2021-08-27 05:32:19,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 277 transitions. [2021-08-27 05:32:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 05:32:19,720 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:19,720 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 05:32:19,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 05:32:19,721 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr19REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash 5095342, now seen corresponding path program 1 times [2021-08-27 05:32:19,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:19,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735642044] [2021-08-27 05:32:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:19,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:19,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:19,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:19,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735642044] [2021-08-27 05:32:19,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735642044] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:19,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:19,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 05:32:19,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565821901] [2021-08-27 05:32:19,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 05:32:19,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:19,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 05:32:19,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-08-27 05:32:19,927 INFO L87 Difference]: Start difference. First operand 248 states and 277 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:21,314 INFO L93 Difference]: Finished difference Result 488 states and 553 transitions. [2021-08-27 05:32:21,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 05:32:21,314 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 05:32:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:21,316 INFO L225 Difference]: With dead ends: 488 [2021-08-27 05:32:21,316 INFO L226 Difference]: Without dead ends: 488 [2021-08-27 05:32:21,316 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 377.7ms TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2021-08-27 05:32:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-08-27 05:32:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 247. [2021-08-27 05:32:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 169 states have (on average 1.6153846153846154) internal successors, (273), 243 states have internal predecessors, (273), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 276 transitions. [2021-08-27 05:32:21,320 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 276 transitions. Word has length 31 [2021-08-27 05:32:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:21,320 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 276 transitions. [2021-08-27 05:32:21,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 276 transitions. [2021-08-27 05:32:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 05:32:21,321 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:21,321 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1] [2021-08-27 05:32:21,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 05:32:21,321 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr54REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:21,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:21,322 INFO L82 PathProgramCache]: Analyzing trace with hash 590886851, now seen corresponding path program 1 times [2021-08-27 05:32:21,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:21,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183173236] [2021-08-27 05:32:21,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:21,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:21,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:21,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:21,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183173236] [2021-08-27 05:32:21,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183173236] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:21,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:21,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 05:32:21,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061185715] [2021-08-27 05:32:21,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:32:21,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:21,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:32:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:32:21,402 INFO L87 Difference]: Start difference. First operand 247 states and 276 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:21,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:21,782 INFO L93 Difference]: Finished difference Result 269 states and 300 transitions. [2021-08-27 05:32:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 05:32:21,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-08-27 05:32:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:21,783 INFO L225 Difference]: With dead ends: 269 [2021-08-27 05:32:21,783 INFO L226 Difference]: Without dead ends: 269 [2021-08-27 05:32:21,783 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 95.2ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:32:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-08-27 05:32:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 247. [2021-08-27 05:32:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 169 states have (on average 1.6094674556213018) internal successors, (272), 243 states have internal predecessors, (272), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 275 transitions. [2021-08-27 05:32:21,786 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 275 transitions. Word has length 33 [2021-08-27 05:32:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:21,787 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 275 transitions. [2021-08-27 05:32:21,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 275 transitions. [2021-08-27 05:32:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 05:32:21,787 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:21,787 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-08-27 05:32:21,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 05:32:21,788 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1627917513, now seen corresponding path program 1 times [2021-08-27 05:32:21,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:21,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156803590] [2021-08-27 05:32:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:21,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 05:32:21,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:21,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156803590] [2021-08-27 05:32:21,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156803590] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:21,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:21,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:32:21,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785139192] [2021-08-27 05:32:21,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:32:21,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:21,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:32:21,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:32:21,842 INFO L87 Difference]: Start difference. First operand 247 states and 275 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:22,190 INFO L93 Difference]: Finished difference Result 263 states and 294 transitions. [2021-08-27 05:32:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:32:22,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 05:32:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:22,191 INFO L225 Difference]: With dead ends: 263 [2021-08-27 05:32:22,191 INFO L226 Difference]: Without dead ends: 263 [2021-08-27 05:32:22,191 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.8ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:32:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-08-27 05:32:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 246. [2021-08-27 05:32:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 169 states have (on average 1.6035502958579881) internal successors, (271), 242 states have internal predecessors, (271), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 274 transitions. [2021-08-27 05:32:22,195 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 274 transitions. Word has length 35 [2021-08-27 05:32:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:22,195 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 274 transitions. [2021-08-27 05:32:22,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 274 transitions. [2021-08-27 05:32:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 05:32:22,195 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:22,196 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2021-08-27 05:32:22,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 05:32:22,196 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:22,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1627917512, now seen corresponding path program 1 times [2021-08-27 05:32:22,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:22,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627953966] [2021-08-27 05:32:22,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:22,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:22,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:22,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:22,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627953966] [2021-08-27 05:32:22,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627953966] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:22,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:22,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 05:32:22,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240916268] [2021-08-27 05:32:22,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 05:32:22,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:22,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 05:32:22,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:32:22,344 INFO L87 Difference]: Start difference. First operand 246 states and 274 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:22,966 INFO L93 Difference]: Finished difference Result 378 states and 425 transitions. [2021-08-27 05:32:22,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 05:32:22,966 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 05:32:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:22,967 INFO L225 Difference]: With dead ends: 378 [2021-08-27 05:32:22,967 INFO L226 Difference]: Without dead ends: 378 [2021-08-27 05:32:22,968 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 155.9ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:32:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-08-27 05:32:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 245. [2021-08-27 05:32:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 169 states have (on average 1.5976331360946745) internal successors, (270), 241 states have internal predecessors, (270), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 273 transitions. [2021-08-27 05:32:22,972 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 273 transitions. Word has length 35 [2021-08-27 05:32:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:22,973 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 273 transitions. [2021-08-27 05:32:22,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 273 transitions. [2021-08-27 05:32:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 05:32:22,973 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:22,973 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:22,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 05:32:22,974 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr54REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1455062231, now seen corresponding path program 1 times [2021-08-27 05:32:22,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:22,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080711089] [2021-08-27 05:32:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:22,974 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:23,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:23,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080711089] [2021-08-27 05:32:23,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080711089] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:23,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:23,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 05:32:23,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627203867] [2021-08-27 05:32:23,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:32:23,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:23,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:32:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:32:23,074 INFO L87 Difference]: Start difference. First operand 245 states and 273 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:23,616 INFO L93 Difference]: Finished difference Result 402 states and 447 transitions. [2021-08-27 05:32:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 05:32:23,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-08-27 05:32:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:23,617 INFO L225 Difference]: With dead ends: 402 [2021-08-27 05:32:23,617 INFO L226 Difference]: Without dead ends: 402 [2021-08-27 05:32:23,617 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 48.4ms TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-27 05:32:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-08-27 05:32:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 248. [2021-08-27 05:32:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 174 states have (on average 1.5919540229885059) internal successors, (277), 244 states have internal predecessors, (277), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 280 transitions. [2021-08-27 05:32:23,621 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 280 transitions. Word has length 38 [2021-08-27 05:32:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:23,621 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 280 transitions. [2021-08-27 05:32:23,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 280 transitions. [2021-08-27 05:32:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 05:32:23,621 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:23,621 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:23,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 05:32:23,622 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr55REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:23,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:23,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1455062232, now seen corresponding path program 1 times [2021-08-27 05:32:23,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:23,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285826760] [2021-08-27 05:32:23,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:23,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:23,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:23,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:23,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285826760] [2021-08-27 05:32:23,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285826760] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:23,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:23,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 05:32:23,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162376807] [2021-08-27 05:32:23,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:32:23,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:23,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:32:23,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:32:23,714 INFO L87 Difference]: Start difference. First operand 248 states and 280 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:24,336 INFO L93 Difference]: Finished difference Result 500 states and 564 transitions. [2021-08-27 05:32:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 05:32:24,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-08-27 05:32:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:24,338 INFO L225 Difference]: With dead ends: 500 [2021-08-27 05:32:24,338 INFO L226 Difference]: Without dead ends: 500 [2021-08-27 05:32:24,338 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 120.4ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:32:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-08-27 05:32:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 312. [2021-08-27 05:32:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 238 states have (on average 1.5714285714285714) internal successors, (374), 308 states have internal predecessors, (374), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 377 transitions. [2021-08-27 05:32:24,342 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 377 transitions. Word has length 38 [2021-08-27 05:32:24,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:24,342 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 377 transitions. [2021-08-27 05:32:24,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 377 transitions. [2021-08-27 05:32:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 05:32:24,343 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:24,343 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:24,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 05:32:24,343 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr30REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:24,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1360011905, now seen corresponding path program 1 times [2021-08-27 05:32:24,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:24,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843269334] [2021-08-27 05:32:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:24,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:24,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:24,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:24,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843269334] [2021-08-27 05:32:24,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843269334] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:32:24,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882459423] [2021-08-27 05:32:24,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:24,642 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:32:24,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:32:24,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:32:24,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 05:32:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:24,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 35 conjunts are in the unsatisfiable core [2021-08-27 05:32:24,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:32:25,022 INFO L388 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 13 treesize of output 9 [2021-08-27 05:32:25,027 INFO L388 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 13 treesize of output 9 [2021-08-27 05:32:25,171 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:32:25,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-08-27 05:32:25,183 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-08-27 05:32:25,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2021-08-27 05:32:25,281 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 05:32:25,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 67 [2021-08-27 05:32:25,301 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 05:32:25,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 49 [2021-08-27 05:32:25,426 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 05:32:25,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 62 [2021-08-27 05:32:25,450 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 05:32:25,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 54 [2021-08-27 05:32:25,561 INFO L354 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2021-08-27 05:32:25,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 45 [2021-08-27 05:32:25,571 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-27 05:32:25,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 26 [2021-08-27 05:32:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:25,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882459423] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:32:25,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:32:25,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 22 [2021-08-27 05:32:25,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007756577] [2021-08-27 05:32:25,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 05:32:25,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:25,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 05:32:25,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-08-27 05:32:25,587 INFO L87 Difference]: Start difference. First operand 312 states and 377 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:26,670 INFO L93 Difference]: Finished difference Result 388 states and 462 transitions. [2021-08-27 05:32:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 05:32:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-08-27 05:32:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:26,672 INFO L225 Difference]: With dead ends: 388 [2021-08-27 05:32:26,673 INFO L226 Difference]: Without dead ends: 388 [2021-08-27 05:32:26,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 531.5ms TimeCoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2021-08-27 05:32:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-08-27 05:32:26,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 341. [2021-08-27 05:32:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 267 states have (on average 1.5168539325842696) internal successors, (405), 337 states have internal predecessors, (405), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 408 transitions. [2021-08-27 05:32:26,678 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 408 transitions. Word has length 39 [2021-08-27 05:32:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:26,678 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 408 transitions. [2021-08-27 05:32:26,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 408 transitions. [2021-08-27 05:32:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 05:32:26,678 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:26,679 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:26,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 05:32:26,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-08-27 05:32:26,886 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:26,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:26,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2130971147, now seen corresponding path program 1 times [2021-08-27 05:32:26,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:26,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842713606] [2021-08-27 05:32:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:26,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:27,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:27,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:27,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842713606] [2021-08-27 05:32:27,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842713606] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:27,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:27,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 05:32:27,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624991955] [2021-08-27 05:32:27,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 05:32:27,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:27,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 05:32:27,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:32:27,242 INFO L87 Difference]: Start difference. First operand 341 states and 408 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:28,737 INFO L93 Difference]: Finished difference Result 341 states and 406 transitions. [2021-08-27 05:32:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 05:32:28,737 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-08-27 05:32:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:28,738 INFO L225 Difference]: With dead ends: 341 [2021-08-27 05:32:28,738 INFO L226 Difference]: Without dead ends: 341 [2021-08-27 05:32:28,738 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 724.5ms TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-08-27 05:32:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-08-27 05:32:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2021-08-27 05:32:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 267 states have (on average 1.5093632958801497) internal successors, (403), 337 states have internal predecessors, (403), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 406 transitions. [2021-08-27 05:32:28,743 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 406 transitions. Word has length 39 [2021-08-27 05:32:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:28,743 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 406 transitions. [2021-08-27 05:32:28,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 406 transitions. [2021-08-27 05:32:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 05:32:28,744 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:28,744 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:28,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 05:32:28,745 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:28,745 INFO L82 PathProgramCache]: Analyzing trace with hash -89817257, now seen corresponding path program 1 times [2021-08-27 05:32:28,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:28,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572464807] [2021-08-27 05:32:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:28,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:28,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 05:32:28,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:28,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572464807] [2021-08-27 05:32:28,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572464807] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:28,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:28,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:32:28,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309611675] [2021-08-27 05:32:28,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:32:28,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:28,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:32:28,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:32:28,804 INFO L87 Difference]: Start difference. First operand 341 states and 406 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:29,089 INFO L93 Difference]: Finished difference Result 347 states and 413 transitions. [2021-08-27 05:32:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:32:29,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-08-27 05:32:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:29,091 INFO L225 Difference]: With dead ends: 347 [2021-08-27 05:32:29,091 INFO L226 Difference]: Without dead ends: 347 [2021-08-27 05:32:29,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.5ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:32:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-08-27 05:32:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2021-08-27 05:32:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 271 states have (on average 1.5055350553505535) internal successors, (408), 341 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 411 transitions. [2021-08-27 05:32:29,094 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 411 transitions. Word has length 44 [2021-08-27 05:32:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:29,095 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 411 transitions. [2021-08-27 05:32:29,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 411 transitions. [2021-08-27 05:32:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 05:32:29,095 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:29,095 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:29,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-27 05:32:29,096 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr95REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:29,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1281871034, now seen corresponding path program 1 times [2021-08-27 05:32:29,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:29,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083451336] [2021-08-27 05:32:29,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:29,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:29,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:29,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083451336] [2021-08-27 05:32:29,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083451336] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:29,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:29,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 05:32:29,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992789288] [2021-08-27 05:32:29,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:32:29,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:29,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:32:29,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:32:29,179 INFO L87 Difference]: Start difference. First operand 345 states and 411 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:29,647 INFO L93 Difference]: Finished difference Result 465 states and 519 transitions. [2021-08-27 05:32:29,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 05:32:29,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-08-27 05:32:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:29,648 INFO L225 Difference]: With dead ends: 465 [2021-08-27 05:32:29,649 INFO L226 Difference]: Without dead ends: 465 [2021-08-27 05:32:29,649 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 158.2ms TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-08-27 05:32:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-08-27 05:32:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 344. [2021-08-27 05:32:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.4962962962962962) internal successors, (404), 340 states have internal predecessors, (404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 407 transitions. [2021-08-27 05:32:29,653 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 407 transitions. Word has length 47 [2021-08-27 05:32:29,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:29,653 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 407 transitions. [2021-08-27 05:32:29,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 407 transitions. [2021-08-27 05:32:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-27 05:32:29,654 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:29,654 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:29,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 05:32:29,654 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr95REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:29,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:29,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1820934627, now seen corresponding path program 1 times [2021-08-27 05:32:29,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:29,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245763184] [2021-08-27 05:32:29,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:29,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:29,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 05:32:29,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:29,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245763184] [2021-08-27 05:32:29,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245763184] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:29,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:29,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:32:29,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633814531] [2021-08-27 05:32:29,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:32:29,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:29,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:32:29,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:32:29,710 INFO L87 Difference]: Start difference. First operand 344 states and 407 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:30,079 INFO L93 Difference]: Finished difference Result 449 states and 525 transitions. [2021-08-27 05:32:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:32:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-08-27 05:32:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:30,080 INFO L225 Difference]: With dead ends: 449 [2021-08-27 05:32:30,080 INFO L226 Difference]: Without dead ends: 449 [2021-08-27 05:32:30,080 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:32:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-08-27 05:32:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 348. [2021-08-27 05:32:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 274 states have (on average 1.4927007299270072) internal successors, (409), 344 states have internal predecessors, (409), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 412 transitions. [2021-08-27 05:32:30,084 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 412 transitions. Word has length 49 [2021-08-27 05:32:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:30,084 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 412 transitions. [2021-08-27 05:32:30,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 412 transitions. [2021-08-27 05:32:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-27 05:32:30,085 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:30,085 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:30,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-27 05:32:30,085 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr96REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1820934626, now seen corresponding path program 1 times [2021-08-27 05:32:30,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:30,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013053687] [2021-08-27 05:32:30,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:30,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:30,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:30,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:30,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013053687] [2021-08-27 05:32:30,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013053687] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:30,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:30,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 05:32:30,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98081070] [2021-08-27 05:32:30,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 05:32:30,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:30,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 05:32:30,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:32:30,301 INFO L87 Difference]: Start difference. First operand 348 states and 412 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:31,113 INFO L93 Difference]: Finished difference Result 375 states and 442 transitions. [2021-08-27 05:32:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 05:32:31,113 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-08-27 05:32:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:31,114 INFO L225 Difference]: With dead ends: 375 [2021-08-27 05:32:31,114 INFO L226 Difference]: Without dead ends: 371 [2021-08-27 05:32:31,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 335.6ms TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2021-08-27 05:32:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-08-27 05:32:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 349. [2021-08-27 05:32:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 275 states have (on average 1.4872727272727273) internal successors, (409), 345 states have internal predecessors, (409), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 412 transitions. [2021-08-27 05:32:31,119 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 412 transitions. Word has length 49 [2021-08-27 05:32:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:31,119 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 412 transitions. [2021-08-27 05:32:31,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 412 transitions. [2021-08-27 05:32:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 05:32:31,120 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:31,120 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2021-08-27 05:32:31,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-27 05:32:31,120 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr30REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1472614655, now seen corresponding path program 2 times [2021-08-27 05:32:31,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:31,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569534197] [2021-08-27 05:32:31,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:31,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:31,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:31,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569534197] [2021-08-27 05:32:31,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569534197] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:32:31,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750683907] [2021-08-27 05:32:31,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 05:32:31,678 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:32:31,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:32:31,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:32:31,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 05:32:31,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 05:32:31,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 05:32:31,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-27 05:32:31,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:32:31,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:32:32,055 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 05:32:32,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 05:32:32,153 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-08-27 05:32:32,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2021-08-27 05:32:32,241 INFO L388 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 17 treesize of output 13 [2021-08-27 05:32:32,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:32,306 INFO L388 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 31 treesize of output 30 [2021-08-27 05:32:32,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:32,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:32,494 INFO L354 Elim1Store]: treesize reduction 67, result has 11.8 percent of original size [2021-08-27 05:32:32,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 38 [2021-08-27 05:32:32,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:32,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2021-08-27 05:32:32,576 INFO L388 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 11 treesize of output 7 [2021-08-27 05:32:32,796 INFO L354 Elim1Store]: treesize reduction 184, result has 13.6 percent of original size [2021-08-27 05:32:32,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 110 treesize of output 93 [2021-08-27 05:32:32,810 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 05:32:32,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 97 [2021-08-27 05:32:33,271 INFO L354 Elim1Store]: treesize reduction 170, result has 13.3 percent of original size [2021-08-27 05:32:33,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 123 treesize of output 93 [2021-08-27 05:32:33,283 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 05:32:33,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2021-08-27 05:32:33,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2021-08-27 05:32:33,604 INFO L354 Elim1Store]: treesize reduction 148, result has 11.9 percent of original size [2021-08-27 05:32:33,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 85 treesize of output 61 [2021-08-27 05:32:33,787 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-08-27 05:32:33,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 43 [2021-08-27 05:32:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:33,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750683907] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:33,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 05:32:33,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [23] total 41 [2021-08-27 05:32:33,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513240731] [2021-08-27 05:32:33,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 05:32:33,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:33,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 05:32:33,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1557, Unknown=1, NotChecked=0, Total=1722 [2021-08-27 05:32:33,859 INFO L87 Difference]: Start difference. First operand 349 states and 412 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:36,065 INFO L93 Difference]: Finished difference Result 376 states and 442 transitions. [2021-08-27 05:32:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 05:32:36,065 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-08-27 05:32:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:36,066 INFO L225 Difference]: With dead ends: 376 [2021-08-27 05:32:36,066 INFO L226 Difference]: Without dead ends: 376 [2021-08-27 05:32:36,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 2148.7ms TimeCoverageRelationStatistics Valid=581, Invalid=2958, Unknown=1, NotChecked=0, Total=3540 [2021-08-27 05:32:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-08-27 05:32:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 348. [2021-08-27 05:32:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 275 states have (on average 1.4836363636363636) internal successors, (408), 344 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 411 transitions. [2021-08-27 05:32:36,070 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 411 transitions. Word has length 50 [2021-08-27 05:32:36,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:36,071 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 411 transitions. [2021-08-27 05:32:36,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 411 transitions. [2021-08-27 05:32:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 05:32:36,071 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:36,071 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2021-08-27 05:32:36,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 05:32:36,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-08-27 05:32:36,285 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr31REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:36,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:36,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1472614654, now seen corresponding path program 1 times [2021-08-27 05:32:36,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:36,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621364732] [2021-08-27 05:32:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:36,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:36,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:36,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:36,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621364732] [2021-08-27 05:32:36,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621364732] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:32:36,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079748714] [2021-08-27 05:32:36,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:36,886 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:32:36,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:32:36,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:32:36,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 05:32:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:37,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 56 conjunts are in the unsatisfiable core [2021-08-27 05:32:37,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:32:37,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:32:37,371 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 05:32:37,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-08-27 05:32:37,392 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 05:32:37,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 31 [2021-08-27 05:32:37,571 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-08-27 05:32:37,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 53 [2021-08-27 05:32:37,586 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-08-27 05:32:37,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2021-08-27 05:32:37,777 INFO L388 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 49 treesize of output 45 [2021-08-27 05:32:37,800 INFO L388 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 13 treesize of output 9 [2021-08-27 05:32:38,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:38,082 INFO L354 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2021-08-27 05:32:38,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 58 [2021-08-27 05:32:38,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:38,102 INFO L354 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2021-08-27 05:32:38,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 54 [2021-08-27 05:32:38,204 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:32:38,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 73 [2021-08-27 05:32:38,231 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-08-27 05:32:38,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 110 [2021-08-27 05:32:38,443 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 05:32:38,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 94 [2021-08-27 05:32:38,460 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 05:32:38,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 122 [2021-08-27 05:32:38,851 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 05:32:38,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 135 [2021-08-27 05:32:38,867 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 05:32:38,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 81 [2021-08-27 05:32:39,189 INFO L354 Elim1Store]: treesize reduction 114, result has 13.0 percent of original size [2021-08-27 05:32:39,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 157 treesize of output 102 [2021-08-27 05:32:39,208 INFO L354 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2021-08-27 05:32:39,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 102 [2021-08-27 05:32:39,381 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:32:39,381 INFO L388 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 105 treesize of output 77 [2021-08-27 05:32:39,387 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:32:39,388 INFO L388 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 71 treesize of output 55 [2021-08-27 05:32:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:39,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079748714] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:32:39,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:32:39,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2021-08-27 05:32:39,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410157223] [2021-08-27 05:32:39,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-27 05:32:39,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:39,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-27 05:32:39,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2021-08-27 05:32:39,470 INFO L87 Difference]: Start difference. First operand 348 states and 411 transitions. Second operand has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:45,909 INFO L93 Difference]: Finished difference Result 481 states and 565 transitions. [2021-08-27 05:32:45,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 05:32:45,910 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-08-27 05:32:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:45,911 INFO L225 Difference]: With dead ends: 481 [2021-08-27 05:32:45,911 INFO L226 Difference]: Without dead ends: 481 [2021-08-27 05:32:45,912 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 4901.4ms TimeCoverageRelationStatistics Valid=413, Invalid=2037, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 05:32:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-08-27 05:32:45,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 347. [2021-08-27 05:32:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 275 states have (on average 1.48) internal successors, (407), 343 states have internal predecessors, (407), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 410 transitions. [2021-08-27 05:32:45,915 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 410 transitions. Word has length 50 [2021-08-27 05:32:45,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:45,915 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 410 transitions. [2021-08-27 05:32:45,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 410 transitions. [2021-08-27 05:32:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 05:32:45,916 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:45,916 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:45,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 05:32:46,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:32:46,122 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr96REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:46,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:46,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1309000412, now seen corresponding path program 1 times [2021-08-27 05:32:46,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:46,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320331391] [2021-08-27 05:32:46,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:46,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:46,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:46,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:32:46,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:46,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320331391] [2021-08-27 05:32:46,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320331391] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:46,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:46,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 05:32:46,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361947978] [2021-08-27 05:32:46,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 05:32:46,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:46,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 05:32:46,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:32:46,246 INFO L87 Difference]: Start difference. First operand 347 states and 410 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:46,940 INFO L93 Difference]: Finished difference Result 514 states and 581 transitions. [2021-08-27 05:32:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 05:32:46,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2021-08-27 05:32:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:46,941 INFO L225 Difference]: With dead ends: 514 [2021-08-27 05:32:46,942 INFO L226 Difference]: Without dead ends: 514 [2021-08-27 05:32:46,942 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 126.0ms TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:32:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-08-27 05:32:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 347. [2021-08-27 05:32:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 275 states have (on average 1.4763636363636363) internal successors, (406), 343 states have internal predecessors, (406), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 409 transitions. [2021-08-27 05:32:46,945 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 409 transitions. Word has length 52 [2021-08-27 05:32:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:46,946 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 409 transitions. [2021-08-27 05:32:46,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 409 transitions. [2021-08-27 05:32:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 05:32:46,946 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:46,946 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:46,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-27 05:32:46,947 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr61REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:46,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1866093058, now seen corresponding path program 1 times [2021-08-27 05:32:46,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:46,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063431691] [2021-08-27 05:32:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:46,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:32:47,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:47,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063431691] [2021-08-27 05:32:47,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063431691] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:47,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:47,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 05:32:47,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278928242] [2021-08-27 05:32:47,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 05:32:47,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:47,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 05:32:47,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:32:47,122 INFO L87 Difference]: Start difference. First operand 347 states and 409 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:47,893 INFO L93 Difference]: Finished difference Result 464 states and 517 transitions. [2021-08-27 05:32:47,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 05:32:47,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-08-27 05:32:47,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:47,895 INFO L225 Difference]: With dead ends: 464 [2021-08-27 05:32:47,895 INFO L226 Difference]: Without dead ends: 464 [2021-08-27 05:32:47,895 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 174.4ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:32:47,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-27 05:32:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 379. [2021-08-27 05:32:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 307 states have (on average 1.52442996742671) internal successors, (468), 375 states have internal predecessors, (468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 471 transitions. [2021-08-27 05:32:47,899 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 471 transitions. Word has length 53 [2021-08-27 05:32:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:47,900 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 471 transitions. [2021-08-27 05:32:47,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 471 transitions. [2021-08-27 05:32:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 05:32:47,900 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:47,900 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:47,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-27 05:32:47,901 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:47,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1980895518, now seen corresponding path program 1 times [2021-08-27 05:32:47,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:47,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979861349] [2021-08-27 05:32:47,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:47,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:32:48,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:48,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979861349] [2021-08-27 05:32:48,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979861349] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:32:48,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743574853] [2021-08-27 05:32:48,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:48,309 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:32:48,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:32:48,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:32:48,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 05:32:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:48,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-27 05:32:48,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:32:48,859 INFO L388 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 13 treesize of output 9 [2021-08-27 05:32:48,863 INFO L388 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 13 treesize of output 9 [2021-08-27 05:32:48,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:48,987 INFO L388 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 19 treesize of output 18 [2021-08-27 05:32:48,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:48,991 INFO L388 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 19 treesize of output 18 [2021-08-27 05:32:49,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:49,067 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 05:32:49,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-08-27 05:32:49,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:49,074 INFO L388 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 21 treesize of output 20 [2021-08-27 05:32:49,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:49,219 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 05:32:49,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-08-27 05:32:49,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:49,227 INFO L388 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 21 treesize of output 20 [2021-08-27 05:32:49,293 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:32:49,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2021-08-27 05:32:49,303 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 05:32:49,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 33 [2021-08-27 05:32:49,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-08-27 05:32:49,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-08-27 05:32:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:32:49,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743574853] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:32:49,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:32:49,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 25 [2021-08-27 05:32:49,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844697683] [2021-08-27 05:32:49,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 05:32:49,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:49,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 05:32:49,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2021-08-27 05:32:49,480 INFO L87 Difference]: Start difference. First operand 379 states and 471 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 24 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:50,652 INFO L93 Difference]: Finished difference Result 396 states and 488 transitions. [2021-08-27 05:32:50,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 05:32:50,652 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 24 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2021-08-27 05:32:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:50,653 INFO L225 Difference]: With dead ends: 396 [2021-08-27 05:32:50,653 INFO L226 Difference]: Without dead ends: 396 [2021-08-27 05:32:50,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 717.2ms TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2021-08-27 05:32:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-08-27 05:32:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 390. [2021-08-27 05:32:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 386 states have internal predecessors, (479), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 482 transitions. [2021-08-27 05:32:50,657 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 482 transitions. Word has length 55 [2021-08-27 05:32:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:50,658 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 482 transitions. [2021-08-27 05:32:50,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 24 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 482 transitions. [2021-08-27 05:32:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-27 05:32:50,658 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:50,658 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-27 05:32:50,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 05:32:50,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-08-27 05:32:50,873 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr103REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:50,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:50,873 INFO L82 PathProgramCache]: Analyzing trace with hash 780404745, now seen corresponding path program 1 times [2021-08-27 05:32:50,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:50,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152896781] [2021-08-27 05:32:50,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:50,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:50,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:32:50,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:50,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152896781] [2021-08-27 05:32:50,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152896781] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:32:50,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:32:50,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 05:32:50,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776670307] [2021-08-27 05:32:50,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:32:50,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:50,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:32:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:32:50,943 INFO L87 Difference]: Start difference. First operand 390 states and 482 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:32:51,345 INFO L93 Difference]: Finished difference Result 474 states and 527 transitions. [2021-08-27 05:32:51,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 05:32:51,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2021-08-27 05:32:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:32:51,346 INFO L225 Difference]: With dead ends: 474 [2021-08-27 05:32:51,346 INFO L226 Difference]: Without dead ends: 474 [2021-08-27 05:32:51,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 113.5ms TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:32:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-27 05:32:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 390. [2021-08-27 05:32:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 318 states have (on average 1.5031446540880504) internal successors, (478), 386 states have internal predecessors, (478), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 481 transitions. [2021-08-27 05:32:51,375 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 481 transitions. Word has length 57 [2021-08-27 05:32:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:32:51,376 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 481 transitions. [2021-08-27 05:32:51,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:32:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 481 transitions. [2021-08-27 05:32:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 05:32:51,376 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:32:51,376 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:32:51,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-27 05:32:51,377 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:32:51,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:32:51,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1435255067, now seen corresponding path program 1 times [2021-08-27 05:32:51,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:32:51,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688252403] [2021-08-27 05:32:51,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:51,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:32:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:32:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:52,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:32:52,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688252403] [2021-08-27 05:32:52,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688252403] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:32:52,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969067781] [2021-08-27 05:32:52,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:32:52,655 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:32:52,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:32:52,662 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:32:52,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 05:32:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:32:53,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2021-08-27 05:32:53,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:32:53,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:32:53,275 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 05:32:53,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-08-27 05:32:53,347 INFO L388 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 24 treesize of output 20 [2021-08-27 05:32:53,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:53,417 INFO L388 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 38 treesize of output 29 [2021-08-27 05:32:53,523 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-08-27 05:32:53,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-08-27 05:32:53,619 INFO L388 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 46 treesize of output 33 [2021-08-27 05:32:53,730 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-27 05:32:53,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 36 [2021-08-27 05:32:53,856 INFO L354 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2021-08-27 05:32:53,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2021-08-27 05:32:54,049 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-27 05:32:54,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 60 [2021-08-27 05:32:54,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:54,214 INFO L354 Elim1Store]: treesize reduction 71, result has 11.3 percent of original size [2021-08-27 05:32:54,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 77 [2021-08-27 05:32:54,237 INFO L388 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 13 treesize of output 9 [2021-08-27 05:32:54,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:54,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:54,587 INFO L354 Elim1Store]: treesize reduction 78, result has 36.1 percent of original size [2021-08-27 05:32:54,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 77 [2021-08-27 05:32:54,755 INFO L388 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 19 treesize of output 18 [2021-08-27 05:32:54,785 INFO L354 Elim1Store]: treesize reduction 96, result has 15.0 percent of original size [2021-08-27 05:32:54,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 149 treesize of output 95 [2021-08-27 05:32:55,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:55,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:32:55,186 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-08-27 05:32:55,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 255 treesize of output 257 [2021-08-27 05:32:55,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:55,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:32:55,213 INFO L354 Elim1Store]: treesize reduction 130, result has 11.6 percent of original size [2021-08-27 05:32:55,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 242 treesize of output 122 [2021-08-27 05:32:56,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:56,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:32:56,032 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-08-27 05:32:56,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 264 treesize of output 266 [2021-08-27 05:32:56,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:56,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:32:56,066 INFO L354 Elim1Store]: treesize reduction 154, result has 9.9 percent of original size [2021-08-27 05:32:56,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 251 treesize of output 125 [2021-08-27 05:32:56,690 INFO L354 Elim1Store]: treesize reduction 278, result has 8.9 percent of original size [2021-08-27 05:32:56,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 271 treesize of output 137 [2021-08-27 05:32:56,706 INFO L354 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2021-08-27 05:32:56,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 174 [2021-08-27 05:32:56,915 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 05:32:56,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 104 [2021-08-27 05:32:57,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:32:57,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:32:57,235 INFO L354 Elim1Store]: treesize reduction 130, result has 11.6 percent of original size [2021-08-27 05:32:57,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 167 treesize of output 108 [2021-08-27 05:32:57,713 INFO L354 Elim1Store]: treesize reduction 90, result has 12.6 percent of original size [2021-08-27 05:32:57,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 153 treesize of output 85 [2021-08-27 05:32:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:32:58,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969067781] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:32:58,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:32:58,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 56 [2021-08-27 05:32:58,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600166147] [2021-08-27 05:32:58,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-08-27 05:32:58,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:32:58,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-08-27 05:32:58,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2957, Unknown=0, NotChecked=0, Total=3192 [2021-08-27 05:32:58,047 INFO L87 Difference]: Start difference. First operand 390 states and 481 transitions. Second operand has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 56 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:33:23,646 WARN L207 SmtUtils]: Spent 6.32 s on a formula simplification. DAG size of input: 197 DAG size of output: 171 [2021-08-27 05:33:29,100 WARN L207 SmtUtils]: Spent 5.33 s on a formula simplification. DAG size of input: 197 DAG size of output: 171 [2021-08-27 05:33:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:33:45,391 INFO L93 Difference]: Finished difference Result 450 states and 551 transitions. [2021-08-27 05:33:45,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-27 05:33:45,392 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 56 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-08-27 05:33:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:33:45,393 INFO L225 Difference]: With dead ends: 450 [2021-08-27 05:33:45,393 INFO L226 Difference]: Without dead ends: 450 [2021-08-27 05:33:45,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 38691.5ms TimeCoverageRelationStatistics Valid=1049, Invalid=7506, Unknown=1, NotChecked=0, Total=8556 [2021-08-27 05:33:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-08-27 05:33:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 395. [2021-08-27 05:33:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 323 states have (on average 1.501547987616099) internal successors, (485), 391 states have internal predecessors, (485), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:33:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 488 transitions. [2021-08-27 05:33:45,399 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 488 transitions. Word has length 59 [2021-08-27 05:33:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:33:45,399 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 488 transitions. [2021-08-27 05:33:45,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 56 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:33:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 488 transitions. [2021-08-27 05:33:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 05:33:45,400 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:33:45,400 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:33:45,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-08-27 05:33:45,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-08-27 05:33:45,617 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:33:45,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:33:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1435255068, now seen corresponding path program 1 times [2021-08-27 05:33:45,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:33:45,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386746491] [2021-08-27 05:33:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:33:45,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:33:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:33:47,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:33:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:33:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:33:47,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:33:47,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386746491] [2021-08-27 05:33:47,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386746491] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:33:47,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515024474] [2021-08-27 05:33:47,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:33:47,379 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:33:47,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:33:47,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:33:47,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 05:33:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:33:48,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 93 conjunts are in the unsatisfiable core [2021-08-27 05:33:48,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:33:48,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:33:48,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:33:48,282 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 05:33:48,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-08-27 05:33:48,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 05:33:48,384 INFO L388 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 29 treesize of output 25 [2021-08-27 05:33:48,396 INFO L388 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 11 treesize of output 7 [2021-08-27 05:33:48,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:48,467 INFO L388 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 47 treesize of output 34 [2021-08-27 05:33:48,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:48,487 INFO L388 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 21 treesize of output 20 [2021-08-27 05:33:48,659 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-08-27 05:33:48,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-08-27 05:33:48,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-08-27 05:33:48,832 INFO L388 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 55 treesize of output 38 [2021-08-27 05:33:48,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 05:33:49,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:49,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 41 [2021-08-27 05:33:49,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:49,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-08-27 05:33:49,135 INFO L354 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2021-08-27 05:33:49,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2021-08-27 05:33:49,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2021-08-27 05:33:49,380 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 05:33:49,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 93 [2021-08-27 05:33:49,391 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 05:33:49,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 130 [2021-08-27 05:33:49,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:49,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:33:49,577 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:33:49,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 163 treesize of output 127 [2021-08-27 05:33:49,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:49,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:33:49,592 INFO L354 Elim1Store]: treesize reduction 43, result has 20.4 percent of original size [2021-08-27 05:33:49,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 222 treesize of output 227 [2021-08-27 05:33:50,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:50,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:50,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:50,115 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-08-27 05:33:50,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 28 [2021-08-27 05:33:50,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:50,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:50,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:50,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 54 [2021-08-27 05:33:50,307 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-08-27 05:33:50,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 204 treesize of output 142 [2021-08-27 05:33:50,333 INFO L354 Elim1Store]: treesize reduction 108, result has 20.0 percent of original size [2021-08-27 05:33:50,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 285 treesize of output 293 [2021-08-27 05:33:50,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:50,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:33:50,774 INFO L354 Elim1Store]: treesize reduction 136, result has 16.6 percent of original size [2021-08-27 05:33:50,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 299 treesize of output 310 [2021-08-27 05:33:50,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:50,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:33:50,794 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-08-27 05:33:50,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 286 treesize of output 146 [2021-08-27 05:33:51,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:51,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:33:51,393 INFO L354 Elim1Store]: treesize reduction 136, result has 16.6 percent of original size [2021-08-27 05:33:51,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 299 treesize of output 310 [2021-08-27 05:33:51,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:51,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:33:51,414 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-08-27 05:33:51,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 286 treesize of output 146 [2021-08-27 05:33:51,965 INFO L354 Elim1Store]: treesize reduction 188, result has 13.0 percent of original size [2021-08-27 05:33:51,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 323 treesize of output 171 [2021-08-27 05:33:52,022 INFO L354 Elim1Store]: treesize reduction 172, result has 13.1 percent of original size [2021-08-27 05:33:52,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 223 treesize of output 225 [2021-08-27 05:33:52,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:52,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:33:52,644 INFO L354 Elim1Store]: treesize reduction 184, result has 12.4 percent of original size [2021-08-27 05:33:52,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 250 treesize of output 185 [2021-08-27 05:33:52,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:33:52,650 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:33:52,682 INFO L354 Elim1Store]: treesize reduction 204, result has 12.8 percent of original size [2021-08-27 05:33:52,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 246 treesize of output 251 [2021-08-27 05:33:53,338 INFO L354 Elim1Store]: treesize reduction 129, result has 8.5 percent of original size [2021-08-27 05:33:53,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 257 treesize of output 150 [2021-08-27 05:33:53,364 INFO L354 Elim1Store]: treesize reduction 114, result has 2.6 percent of original size [2021-08-27 05:33:53,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 129 treesize of output 95 [2021-08-27 05:33:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:33:53,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515024474] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:33:53,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:33:53,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 49 [2021-08-27 05:33:53,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488048585] [2021-08-27 05:33:53,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-08-27 05:33:53,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:33:53,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-08-27 05:33:53,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2285, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 05:33:53,692 INFO L87 Difference]: Start difference. First operand 395 states and 488 transitions. Second operand has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 49 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:09,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:09,704 INFO L93 Difference]: Finished difference Result 733 states and 899 transitions. [2021-08-27 05:34:09,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-27 05:34:09,704 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 49 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-08-27 05:34:09,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:09,706 INFO L225 Difference]: With dead ends: 733 [2021-08-27 05:34:09,706 INFO L226 Difference]: Without dead ends: 733 [2021-08-27 05:34:09,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 11654.3ms TimeCoverageRelationStatistics Valid=695, Invalid=5157, Unknown=0, NotChecked=0, Total=5852 [2021-08-27 05:34:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-08-27 05:34:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 395. [2021-08-27 05:34:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 323 states have (on average 1.498452012383901) internal successors, (484), 391 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 487 transitions. [2021-08-27 05:34:09,711 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 487 transitions. Word has length 59 [2021-08-27 05:34:09,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:09,712 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 487 transitions. [2021-08-27 05:34:09,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 49 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 487 transitions. [2021-08-27 05:34:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 05:34:09,712 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:09,712 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-27 05:34:09,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-08-27 05:34:09,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:34:09,933 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr103REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:34:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:09,938 INFO L82 PathProgramCache]: Analyzing trace with hash -342249599, now seen corresponding path program 1 times [2021-08-27 05:34:09,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:09,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850123705] [2021-08-27 05:34:09,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:09,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:10,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:34:10,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:10,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850123705] [2021-08-27 05:34:10,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850123705] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:34:10,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:34:10,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-08-27 05:34:10,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556213597] [2021-08-27 05:34:10,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-27 05:34:10,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:10,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 05:34:10,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2021-08-27 05:34:10,486 INFO L87 Difference]: Start difference. First operand 395 states and 487 transitions. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:12,493 INFO L93 Difference]: Finished difference Result 437 states and 530 transitions. [2021-08-27 05:34:12,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-27 05:34:12,494 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2021-08-27 05:34:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:12,495 INFO L225 Difference]: With dead ends: 437 [2021-08-27 05:34:12,495 INFO L226 Difference]: Without dead ends: 437 [2021-08-27 05:34:12,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1006.0ms TimeCoverageRelationStatistics Valid=245, Invalid=2011, Unknown=0, NotChecked=0, Total=2256 [2021-08-27 05:34:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-08-27 05:34:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 395. [2021-08-27 05:34:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 323 states have (on average 1.4953560371517027) internal successors, (483), 391 states have internal predecessors, (483), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 486 transitions. [2021-08-27 05:34:12,499 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 486 transitions. Word has length 60 [2021-08-27 05:34:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:12,499 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 486 transitions. [2021-08-27 05:34:12,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 486 transitions. [2021-08-27 05:34:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 05:34:12,500 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:12,500 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-27 05:34:12,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-27 05:34:12,500 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr104REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:34:12,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash -342249598, now seen corresponding path program 1 times [2021-08-27 05:34:12,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:12,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446141293] [2021-08-27 05:34:12,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:12,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:13,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:34:13,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:13,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446141293] [2021-08-27 05:34:13,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446141293] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:34:13,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:34:13,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-08-27 05:34:13,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619010289] [2021-08-27 05:34:13,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-27 05:34:13,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:13,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 05:34:13,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2021-08-27 05:34:13,181 INFO L87 Difference]: Start difference. First operand 395 states and 486 transitions. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:16,135 INFO L93 Difference]: Finished difference Result 531 states and 630 transitions. [2021-08-27 05:34:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 05:34:16,136 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2021-08-27 05:34:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:16,137 INFO L225 Difference]: With dead ends: 531 [2021-08-27 05:34:16,137 INFO L226 Difference]: Without dead ends: 531 [2021-08-27 05:34:16,138 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1496.4ms TimeCoverageRelationStatistics Valid=257, Invalid=2095, Unknown=0, NotChecked=0, Total=2352 [2021-08-27 05:34:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-08-27 05:34:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 395. [2021-08-27 05:34:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 323 states have (on average 1.4922600619195046) internal successors, (482), 391 states have internal predecessors, (482), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 485 transitions. [2021-08-27 05:34:16,142 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 485 transitions. Word has length 60 [2021-08-27 05:34:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:16,142 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 485 transitions. [2021-08-27 05:34:16,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 485 transitions. [2021-08-27 05:34:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 05:34:16,142 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:16,143 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-27 05:34:16,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-27 05:34:16,143 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr139REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:34:16,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:16,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2020149950, now seen corresponding path program 1 times [2021-08-27 05:34:16,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:16,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615610971] [2021-08-27 05:34:16,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:16,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:34:16,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:16,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615610971] [2021-08-27 05:34:16,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615610971] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:34:16,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:34:16,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 05:34:16,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633938779] [2021-08-27 05:34:16,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 05:34:16,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:16,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 05:34:16,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-08-27 05:34:16,249 INFO L87 Difference]: Start difference. First operand 395 states and 485 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:16,816 INFO L93 Difference]: Finished difference Result 494 states and 550 transitions. [2021-08-27 05:34:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 05:34:16,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2021-08-27 05:34:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:16,818 INFO L225 Difference]: With dead ends: 494 [2021-08-27 05:34:16,818 INFO L226 Difference]: Without dead ends: 494 [2021-08-27 05:34:16,818 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 170.1ms TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2021-08-27 05:34:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-08-27 05:34:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 395. [2021-08-27 05:34:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 323 states have (on average 1.4891640866873066) internal successors, (481), 391 states have internal predecessors, (481), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 484 transitions. [2021-08-27 05:34:16,822 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 484 transitions. Word has length 61 [2021-08-27 05:34:16,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:16,822 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 484 transitions. [2021-08-27 05:34:16,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 484 transitions. [2021-08-27 05:34:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 05:34:16,823 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:16,823 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:34:16,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-27 05:34:16,823 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr45REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:34:16,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1161251878, now seen corresponding path program 1 times [2021-08-27 05:34:16,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:16,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896250788] [2021-08-27 05:34:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:16,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:17,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:34:17,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:17,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896250788] [2021-08-27 05:34:17,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896250788] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:34:17,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884647429] [2021-08-27 05:34:17,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:17,560 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:34:17,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:34:17,562 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:34:17,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 05:34:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:18,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 56 conjunts are in the unsatisfiable core [2021-08-27 05:34:18,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:34:18,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:34:18,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:34:18,783 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 05:34:18,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2021-08-27 05:34:18,788 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 05:34:18,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2021-08-27 05:34:18,892 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-08-27 05:34:18,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2021-08-27 05:34:18,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:34:18,988 INFO L388 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 28 treesize of output 24 [2021-08-27 05:34:18,995 INFO L388 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 17 treesize of output 13 [2021-08-27 05:34:19,177 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 05:34:19,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 05:34:19,195 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 05:34:19,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 42 [2021-08-27 05:34:19,267 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:34:19,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2021-08-27 05:34:19,283 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-08-27 05:34:19,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 52 [2021-08-27 05:34:19,391 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 05:34:19,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 68 [2021-08-27 05:34:19,406 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 05:34:19,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 64 [2021-08-27 05:34:19,567 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 05:34:19,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 77 [2021-08-27 05:34:19,596 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 05:34:19,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2021-08-27 05:34:19,797 INFO L354 Elim1Store]: treesize reduction 110, result has 16.0 percent of original size [2021-08-27 05:34:19,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 83 [2021-08-27 05:34:19,817 INFO L354 Elim1Store]: treesize reduction 84, result has 11.6 percent of original size [2021-08-27 05:34:19,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 63 [2021-08-27 05:34:20,059 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 05:34:20,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 79 [2021-08-27 05:34:20,075 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 05:34:20,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 62 [2021-08-27 05:34:20,374 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 05:34:20,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 75 [2021-08-27 05:34:20,390 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 05:34:20,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 66 [2021-08-27 05:34:20,489 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:34:20,490 INFO L388 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 74 treesize of output 58 [2021-08-27 05:34:20,493 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 05:34:20,493 INFO L388 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 52 treesize of output 32 [2021-08-27 05:34:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:34:20,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884647429] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:34:20,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 05:34:20,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [20] total 35 [2021-08-27 05:34:20,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759808498] [2021-08-27 05:34:20,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 05:34:20,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:20,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 05:34:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2021-08-27 05:34:20,556 INFO L87 Difference]: Start difference. First operand 395 states and 484 transitions. Second operand has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:22,829 INFO L93 Difference]: Finished difference Result 438 states and 535 transitions. [2021-08-27 05:34:22,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 05:34:22,829 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-08-27 05:34:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:22,830 INFO L225 Difference]: With dead ends: 438 [2021-08-27 05:34:22,830 INFO L226 Difference]: Without dead ends: 438 [2021-08-27 05:34:22,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2016.7ms TimeCoverageRelationStatistics Valid=361, Invalid=2395, Unknown=0, NotChecked=0, Total=2756 [2021-08-27 05:34:22,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-08-27 05:34:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 405. [2021-08-27 05:34:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 333 states have (on average 1.4924924924924925) internal successors, (497), 401 states have internal predecessors, (497), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 500 transitions. [2021-08-27 05:34:22,835 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 500 transitions. Word has length 63 [2021-08-27 05:34:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:22,835 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 500 transitions. [2021-08-27 05:34:22,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:22,835 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 500 transitions. [2021-08-27 05:34:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 05:34:22,836 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:22,836 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:34:22,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 05:34:23,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:34:23,053 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting mainErr44REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:34:23,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:23,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1161251877, now seen corresponding path program 1 times [2021-08-27 05:34:23,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:23,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580329713] [2021-08-27 05:34:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:23,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-27 05:34:23,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:23,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580329713] [2021-08-27 05:34:23,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580329713] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:34:23,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:34:23,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:34:23,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192760107] [2021-08-27 05:34:23,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:34:23,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:34:23,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:34:23,113 INFO L87 Difference]: Start difference. First operand 405 states and 500 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:23,539 INFO L93 Difference]: Finished difference Result 410 states and 502 transitions. [2021-08-27 05:34:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:34:23,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-08-27 05:34:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:23,540 INFO L225 Difference]: With dead ends: 410 [2021-08-27 05:34:23,540 INFO L226 Difference]: Without dead ends: 410 [2021-08-27 05:34:23,541 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.0ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:34:23,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-08-27 05:34:23,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 405. [2021-08-27 05:34:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 333 states have (on average 1.4894894894894894) internal successors, (496), 401 states have internal predecessors, (496), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 499 transitions. [2021-08-27 05:34:23,544 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 499 transitions. Word has length 63 [2021-08-27 05:34:23,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:23,544 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 499 transitions. [2021-08-27 05:34:23,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 499 transitions. [2021-08-27 05:34:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 05:34:23,545 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:23,545 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-27 05:34:23,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-27 05:34:23,545 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting mainErr109REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:34:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash 551741131, now seen corresponding path program 1 times [2021-08-27 05:34:23,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:23,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699285561] [2021-08-27 05:34:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:23,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:23,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 05:34:23,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:23,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699285561] [2021-08-27 05:34:23,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699285561] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:34:23,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:34:23,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:34:23,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185539839] [2021-08-27 05:34:23,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:34:23,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:23,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:34:23,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:34:23,605 INFO L87 Difference]: Start difference. First operand 405 states and 499 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:23,991 INFO L93 Difference]: Finished difference Result 466 states and 574 transitions. [2021-08-27 05:34:23,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:34:23,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2021-08-27 05:34:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:23,993 INFO L225 Difference]: With dead ends: 466 [2021-08-27 05:34:23,993 INFO L226 Difference]: Without dead ends: 466 [2021-08-27 05:34:23,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 39.7ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:34:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-08-27 05:34:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 415. [2021-08-27 05:34:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 343 states have (on average 1.4868804664723032) internal successors, (510), 411 states have internal predecessors, (510), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 513 transitions. [2021-08-27 05:34:23,997 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 513 transitions. Word has length 64 [2021-08-27 05:34:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:23,997 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 513 transitions. [2021-08-27 05:34:23,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 513 transitions. [2021-08-27 05:34:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 05:34:23,997 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:23,998 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-27 05:34:23,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-27 05:34:23,998 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting mainErr110REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:34:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash 551741132, now seen corresponding path program 1 times [2021-08-27 05:34:23,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:23,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195413025] [2021-08-27 05:34:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:23,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:24,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:34:24,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:24,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195413025] [2021-08-27 05:34:24,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195413025] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:34:24,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:34:24,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 05:34:24,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755808987] [2021-08-27 05:34:24,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 05:34:24,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:24,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 05:34:24,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:34:24,247 INFO L87 Difference]: Start difference. First operand 415 states and 513 transitions. Second operand has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:25,466 INFO L93 Difference]: Finished difference Result 532 states and 601 transitions. [2021-08-27 05:34:25,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 05:34:25,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2021-08-27 05:34:25,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:25,468 INFO L225 Difference]: With dead ends: 532 [2021-08-27 05:34:25,468 INFO L226 Difference]: Without dead ends: 532 [2021-08-27 05:34:25,469 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 424.5ms TimeCoverageRelationStatistics Valid=229, Invalid=961, Unknown=0, NotChecked=0, Total=1190 [2021-08-27 05:34:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-08-27 05:34:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 415. [2021-08-27 05:34:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 343 states have (on average 1.4839650145772594) internal successors, (509), 411 states have internal predecessors, (509), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 512 transitions. [2021-08-27 05:34:25,473 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 512 transitions. Word has length 64 [2021-08-27 05:34:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:25,473 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 512 transitions. [2021-08-27 05:34:25,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 512 transitions. [2021-08-27 05:34:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-27 05:34:25,473 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:25,474 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-27 05:34:25,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-27 05:34:25,474 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting mainErr139REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:34:25,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:25,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1941451615, now seen corresponding path program 1 times [2021-08-27 05:34:25,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:25,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138134469] [2021-08-27 05:34:25,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:25,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:25,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 05:34:25,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:25,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138134469] [2021-08-27 05:34:25,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138134469] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:34:25,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:34:25,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:34:25,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227412034] [2021-08-27 05:34:25,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 05:34:25,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:25,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 05:34:25,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:34:25,536 INFO L87 Difference]: Start difference. First operand 415 states and 512 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:25,971 INFO L93 Difference]: Finished difference Result 501 states and 610 transitions. [2021-08-27 05:34:25,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:34:25,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-08-27 05:34:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:25,972 INFO L225 Difference]: With dead ends: 501 [2021-08-27 05:34:25,972 INFO L226 Difference]: Without dead ends: 501 [2021-08-27 05:34:25,973 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.8ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:34:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-08-27 05:34:25,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 465. [2021-08-27 05:34:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 393 states have (on average 1.4860050890585241) internal successors, (584), 461 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 587 transitions. [2021-08-27 05:34:25,976 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 587 transitions. Word has length 66 [2021-08-27 05:34:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:25,977 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 587 transitions. [2021-08-27 05:34:25,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 587 transitions. [2021-08-27 05:34:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-27 05:34:25,977 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:25,977 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:34:25,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-27 05:34:25,977 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:34:25,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:25,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1975024740, now seen corresponding path program 2 times [2021-08-27 05:34:25,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:25,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675127706] [2021-08-27 05:34:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:25,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:26,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 05:34:26,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:26,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675127706] [2021-08-27 05:34:26,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675127706] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:34:26,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338929207] [2021-08-27 05:34:26,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 05:34:26,228 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:34:26,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:34:26,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:34:26,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 05:34:27,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-27 05:34:27,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 05:34:27,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-27 05:34:27,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:34:27,517 INFO L388 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 11 treesize of output 7 [2021-08-27 05:34:27,520 INFO L388 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 11 treesize of output 7 [2021-08-27 05:34:27,557 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 05:34:27,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 05:34:27,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:27,561 INFO L388 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 21 treesize of output 20 [2021-08-27 05:34:27,618 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 05:34:27,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 05:34:27,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:27,623 INFO L388 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 21 treesize of output 20 [2021-08-27 05:34:27,718 INFO L354 Elim1Store]: treesize reduction 42, result has 43.2 percent of original size [2021-08-27 05:34:27,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 79 [2021-08-27 05:34:27,739 INFO L354 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2021-08-27 05:34:27,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 74 [2021-08-27 05:34:28,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 72 [2021-08-27 05:34:29,010 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 05:34:29,011 INFO L388 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 113 treesize of output 85 [2021-08-27 05:34:29,014 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 05:34:29,015 INFO L388 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 79 treesize of output 51 [2021-08-27 05:34:29,020 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 05:34:29,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2021-08-27 05:34:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 05:34:29,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338929207] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:34:29,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 05:34:29,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 23 [2021-08-27 05:34:29,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843532320] [2021-08-27 05:34:29,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 05:34:29,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 05:34:29,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2021-08-27 05:34:29,074 INFO L87 Difference]: Start difference. First operand 465 states and 587 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:29,691 INFO L93 Difference]: Finished difference Result 473 states and 595 transitions. [2021-08-27 05:34:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 05:34:29,691 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-08-27 05:34:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:29,692 INFO L225 Difference]: With dead ends: 473 [2021-08-27 05:34:29,692 INFO L226 Difference]: Without dead ends: 473 [2021-08-27 05:34:29,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 450.5ms TimeCoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2021-08-27 05:34:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-08-27 05:34:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 461. [2021-08-27 05:34:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 389 states have (on average 1.4910025706940875) internal successors, (580), 457 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 583 transitions. [2021-08-27 05:34:29,696 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 583 transitions. Word has length 66 [2021-08-27 05:34:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:29,697 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 583 transitions. [2021-08-27 05:34:29,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 583 transitions. [2021-08-27 05:34:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 05:34:29,697 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:29,697 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:34:29,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 05:34:29,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-08-27 05:34:29,898 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:34:29,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:29,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1857994915, now seen corresponding path program 1 times [2021-08-27 05:34:29,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:29,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703711244] [2021-08-27 05:34:29,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:29,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:34:31,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:31,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703711244] [2021-08-27 05:34:31,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703711244] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:34:31,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462049870] [2021-08-27 05:34:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:31,264 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:34:31,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:34:31,272 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:34:31,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-27 05:34:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:32,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 98 conjunts are in the unsatisfiable core [2021-08-27 05:34:32,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:34:32,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:34:32,582 INFO L388 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 13 treesize of output 9 [2021-08-27 05:34:32,588 INFO L388 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 13 treesize of output 9 [2021-08-27 05:34:32,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:32,617 INFO L388 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 13 [2021-08-27 05:34:32,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:32,625 INFO L388 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 13 [2021-08-27 05:34:32,658 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 05:34:32,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-08-27 05:34:32,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:32,732 INFO L388 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 59 treesize of output 58 [2021-08-27 05:34:32,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:32,735 INFO L388 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 60 treesize of output 59 [2021-08-27 05:34:32,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:32,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:32,834 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 05:34:32,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 71 [2021-08-27 05:34:32,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:32,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:32,843 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-08-27 05:34:32,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 71 [2021-08-27 05:34:33,007 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-08-27 05:34:33,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-08-27 05:34:33,140 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 05:34:33,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 75 [2021-08-27 05:34:33,149 INFO L354 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2021-08-27 05:34:33,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 88 [2021-08-27 05:34:33,330 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 05:34:33,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 89 [2021-08-27 05:34:33,347 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-27 05:34:33,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 91 [2021-08-27 05:34:33,442 INFO L354 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2021-08-27 05:34:33,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2021-08-27 05:34:33,648 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-27 05:34:33,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 109 [2021-08-27 05:34:33,661 INFO L354 Elim1Store]: treesize reduction 83, result has 13.5 percent of original size [2021-08-27 05:34:33,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 138 treesize of output 143 [2021-08-27 05:34:33,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:33,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:33,846 INFO L354 Elim1Store]: treesize reduction 124, result has 14.5 percent of original size [2021-08-27 05:34:33,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 171 treesize of output 141 [2021-08-27 05:34:33,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:33,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:33,866 INFO L354 Elim1Store]: treesize reduction 164, result has 15.0 percent of original size [2021-08-27 05:34:33,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 230 treesize of output 237 [2021-08-27 05:34:34,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:34,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:34,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:34,328 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-08-27 05:34:34,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 28 [2021-08-27 05:34:34,491 INFO L354 Elim1Store]: treesize reduction 184, result has 14.0 percent of original size [2021-08-27 05:34:34,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 203 treesize of output 213 [2021-08-27 05:34:34,523 INFO L354 Elim1Store]: treesize reduction 162, result has 14.7 percent of original size [2021-08-27 05:34:34,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 199 treesize of output 143 [2021-08-27 05:34:34,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:34,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:34,914 INFO L354 Elim1Store]: treesize reduction 332, result has 12.2 percent of original size [2021-08-27 05:34:34,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 294 treesize of output 303 [2021-08-27 05:34:34,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:34,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:34,955 INFO L354 Elim1Store]: treesize reduction 152, result has 12.6 percent of original size [2021-08-27 05:34:34,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 18 case distinctions, treesize of input 281 treesize of output 154 [2021-08-27 05:34:35,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:35,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:35,443 INFO L354 Elim1Store]: treesize reduction 332, result has 12.2 percent of original size [2021-08-27 05:34:35,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 294 treesize of output 303 [2021-08-27 05:34:35,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:35,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:35,485 INFO L354 Elim1Store]: treesize reduction 152, result has 12.6 percent of original size [2021-08-27 05:34:35,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 18 case distinctions, treesize of input 281 treesize of output 154 [2021-08-27 05:34:35,962 INFO L354 Elim1Store]: treesize reduction 290, result has 10.8 percent of original size [2021-08-27 05:34:35,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 318 treesize of output 179 [2021-08-27 05:34:36,021 INFO L354 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2021-08-27 05:34:36,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 222 treesize of output 226 [2021-08-27 05:34:36,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:36,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:36,634 INFO L354 Elim1Store]: treesize reduction 350, result has 8.1 percent of original size [2021-08-27 05:34:36,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 25 case distinctions, treesize of input 249 treesize of output 182 [2021-08-27 05:34:36,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:36,699 INFO L354 Elim1Store]: treesize reduction 396, result has 8.5 percent of original size [2021-08-27 05:34:36,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 241 treesize of output 244 [2021-08-27 05:34:37,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:37,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:37,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:37,608 INFO L354 Elim1Store]: treesize reduction 191, result has 5.9 percent of original size [2021-08-27 05:34:37,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 27 case distinctions, treesize of input 241 treesize of output 122 [2021-08-27 05:34:37,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:37,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:37,931 INFO L354 Elim1Store]: treesize reduction 312, result has 9.0 percent of original size [2021-08-27 05:34:37,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 32 case distinctions, treesize of input 130 treesize of output 132 [2021-08-27 05:34:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:34:38,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462049870] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:34:38,195 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:34:38,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25] total 50 [2021-08-27 05:34:38,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160238160] [2021-08-27 05:34:38,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-08-27 05:34:38,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:38,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-08-27 05:34:38,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2277, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 05:34:38,196 INFO L87 Difference]: Start difference. First operand 461 states and 583 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 49 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:34:48,860 INFO L93 Difference]: Finished difference Result 535 states and 662 transitions. [2021-08-27 05:34:48,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-27 05:34:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 49 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2021-08-27 05:34:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:34:48,862 INFO L225 Difference]: With dead ends: 535 [2021-08-27 05:34:48,862 INFO L226 Difference]: Without dead ends: 535 [2021-08-27 05:34:48,863 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 9139.5ms TimeCoverageRelationStatistics Valid=603, Invalid=5717, Unknown=0, NotChecked=0, Total=6320 [2021-08-27 05:34:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-08-27 05:34:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 455. [2021-08-27 05:34:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 383 states have (on average 1.485639686684073) internal successors, (569), 451 states have internal predecessors, (569), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 572 transitions. [2021-08-27 05:34:48,867 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 572 transitions. Word has length 67 [2021-08-27 05:34:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:34:48,867 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 572 transitions. [2021-08-27 05:34:48,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 49 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:34:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 572 transitions. [2021-08-27 05:34:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 05:34:48,868 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:34:48,868 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:34:48,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-27 05:34:49,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:34:49,077 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting mainErr50REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:34:49,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:34:49,077 INFO L82 PathProgramCache]: Analyzing trace with hash 49827309, now seen corresponding path program 1 times [2021-08-27 05:34:49,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:34:49,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148748128] [2021-08-27 05:34:49,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:49,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:34:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:50,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:34:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:34:50,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:34:50,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148748128] [2021-08-27 05:34:50,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148748128] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:34:50,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134993599] [2021-08-27 05:34:50,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:34:50,045 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:34:50,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:34:50,045 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:34:50,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 05:34:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:34:51,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 76 conjunts are in the unsatisfiable core [2021-08-27 05:34:51,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:34:51,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:34:51,718 INFO L388 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 13 treesize of output 9 [2021-08-27 05:34:51,721 INFO L388 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 13 treesize of output 9 [2021-08-27 05:34:51,831 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 05:34:51,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-08-27 05:34:51,905 INFO L388 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 21 treesize of output 20 [2021-08-27 05:34:51,911 INFO L388 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 21 treesize of output 20 [2021-08-27 05:34:52,006 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-27 05:34:52,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2021-08-27 05:34:52,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:52,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-08-27 05:34:52,063 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-08-27 05:34:52,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-08-27 05:34:52,198 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-08-27 05:34:52,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 70 [2021-08-27 05:34:52,208 INFO L354 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2021-08-27 05:34:52,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 67 [2021-08-27 05:34:52,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:52,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:52,312 INFO L354 Elim1Store]: treesize reduction 98, result has 17.6 percent of original size [2021-08-27 05:34:52,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 101 [2021-08-27 05:34:52,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:34:52,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:34:52,330 INFO L354 Elim1Store]: treesize reduction 112, result has 18.2 percent of original size [2021-08-27 05:34:52,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 126 treesize of output 130 [2021-08-27 05:34:52,617 INFO L354 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2021-08-27 05:34:52,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 33 [2021-08-27 05:34:52,728 INFO L354 Elim1Store]: treesize reduction 176, result has 16.6 percent of original size [2021-08-27 05:34:52,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 134 treesize of output 116 [2021-08-27 05:34:52,761 INFO L354 Elim1Store]: treesize reduction 264, result has 16.7 percent of original size [2021-08-27 05:34:52,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 187 treesize of output 190 [2021-08-27 05:34:52,978 INFO L354 Elim1Store]: treesize reduction 372, result has 13.9 percent of original size [2021-08-27 05:34:52,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 209 treesize of output 215 [2021-08-27 05:34:53,026 INFO L354 Elim1Store]: treesize reduction 224, result has 13.8 percent of original size [2021-08-27 05:34:53,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 196 treesize of output 127 [2021-08-27 05:34:53,380 INFO L354 Elim1Store]: treesize reduction 372, result has 13.9 percent of original size [2021-08-27 05:34:53,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 209 treesize of output 215 [2021-08-27 05:34:53,435 INFO L354 Elim1Store]: treesize reduction 224, result has 13.8 percent of original size [2021-08-27 05:34:53,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 196 treesize of output 127 [2021-08-27 05:34:53,797 INFO L354 Elim1Store]: treesize reduction 322, result has 9.0 percent of original size [2021-08-27 05:34:53,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 233 treesize of output 142 [2021-08-27 05:34:53,854 INFO L354 Elim1Store]: treesize reduction 324, result has 12.0 percent of original size [2021-08-27 05:34:53,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 151 treesize of output 156 [2021-08-27 05:34:54,279 INFO L354 Elim1Store]: treesize reduction 266, result has 13.6 percent of original size [2021-08-27 05:34:54,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 160 treesize of output 141 [2021-08-27 05:34:54,327 INFO L354 Elim1Store]: treesize reduction 276, result has 13.8 percent of original size [2021-08-27 05:34:54,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 147 treesize of output 153 [2021-08-27 05:34:54,855 INFO L354 Elim1Store]: treesize reduction 276, result has 13.8 percent of original size [2021-08-27 05:34:54,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 160 treesize of output 166 [2021-08-27 05:34:54,905 INFO L354 Elim1Store]: treesize reduction 266, result has 13.6 percent of original size [2021-08-27 05:34:54,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 147 treesize of output 128 [2021-08-27 05:34:55,214 INFO L354 Elim1Store]: treesize reduction 210, result has 1.4 percent of original size [2021-08-27 05:34:55,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 168 treesize of output 100 [2021-08-27 05:34:55,238 INFO L354 Elim1Store]: treesize reduction 146, result has 2.0 percent of original size [2021-08-27 05:34:55,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 56 [2021-08-27 05:34:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:34:55,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134993599] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:34:55,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:34:55,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20] total 44 [2021-08-27 05:34:55,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177315306] [2021-08-27 05:34:55,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-08-27 05:34:55,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:34:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-08-27 05:34:55,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1753, Unknown=0, NotChecked=0, Total=1892 [2021-08-27 05:34:55,254 INFO L87 Difference]: Start difference. First operand 455 states and 572 transitions. Second operand has 44 states, 44 states have (on average 2.75) internal successors, (121), 43 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:35:01,641 INFO L93 Difference]: Finished difference Result 536 states and 660 transitions. [2021-08-27 05:35:01,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 05:35:01,645 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.75) internal successors, (121), 43 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2021-08-27 05:35:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:35:01,646 INFO L225 Difference]: With dead ends: 536 [2021-08-27 05:35:01,646 INFO L226 Difference]: Without dead ends: 536 [2021-08-27 05:35:01,647 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 3485.8ms TimeCoverageRelationStatistics Valid=375, Invalid=4047, Unknown=0, NotChecked=0, Total=4422 [2021-08-27 05:35:01,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-08-27 05:35:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2021-08-27 05:35:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 429 states have (on average 1.4405594405594406) internal successors, (618), 497 states have internal predecessors, (618), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 621 transitions. [2021-08-27 05:35:01,651 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 621 transitions. Word has length 67 [2021-08-27 05:35:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:35:01,651 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 621 transitions. [2021-08-27 05:35:01,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.75) internal successors, (121), 43 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 621 transitions. [2021-08-27 05:35:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 05:35:01,652 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:35:01,652 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-27 05:35:01,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-27 05:35:01,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2021-08-27 05:35:01,853 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting mainErr123REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:35:01,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:35:01,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1725828425, now seen corresponding path program 1 times [2021-08-27 05:35:01,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:35:01,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049468725] [2021-08-27 05:35:01,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:35:01,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:35:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:02,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:35:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:35:02,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:35:02,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049468725] [2021-08-27 05:35:02,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049468725] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:35:02,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:35:02,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-08-27 05:35:02,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197401162] [2021-08-27 05:35:02,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-27 05:35:02,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:35:02,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-27 05:35:02,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2021-08-27 05:35:02,817 INFO L87 Difference]: Start difference. First operand 501 states and 621 transitions. Second operand has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:35:05,772 INFO L93 Difference]: Finished difference Result 538 states and 660 transitions. [2021-08-27 05:35:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-27 05:35:05,773 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-08-27 05:35:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:35:05,774 INFO L225 Difference]: With dead ends: 538 [2021-08-27 05:35:05,774 INFO L226 Difference]: Without dead ends: 538 [2021-08-27 05:35:05,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1882.3ms TimeCoverageRelationStatistics Valid=260, Invalid=2496, Unknown=0, NotChecked=0, Total=2756 [2021-08-27 05:35:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-08-27 05:35:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 501. [2021-08-27 05:35:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 429 states have (on average 1.4382284382284383) internal successors, (617), 497 states have internal predecessors, (617), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 620 transitions. [2021-08-27 05:35:05,778 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 620 transitions. Word has length 68 [2021-08-27 05:35:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:35:05,779 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 620 transitions. [2021-08-27 05:35:05,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:05,779 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 620 transitions. [2021-08-27 05:35:05,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 05:35:05,779 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:35:05,779 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-27 05:35:05,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-08-27 05:35:05,780 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting mainErr115REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:35:05,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:35:05,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1798179629, now seen corresponding path program 1 times [2021-08-27 05:35:05,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:35:05,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160735279] [2021-08-27 05:35:05,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:35:05,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:35:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:06,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:35:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:35:06,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:35:06,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160735279] [2021-08-27 05:35:06,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160735279] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:35:06,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16964366] [2021-08-27 05:35:06,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:35:06,387 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:35:06,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:35:06,388 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:35:06,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 05:35:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:08,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 45 conjunts are in the unsatisfiable core [2021-08-27 05:35:08,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:35:08,471 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 05:35:08,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 05:35:08,505 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:35:08,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 69 [2021-08-27 05:35:08,514 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-08-27 05:35:08,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 100 [2021-08-27 05:35:08,673 INFO L354 Elim1Store]: treesize reduction 64, result has 17.9 percent of original size [2021-08-27 05:35:08,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 135 [2021-08-27 05:35:08,684 INFO L354 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2021-08-27 05:35:08,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 165 treesize of output 154 [2021-08-27 05:35:08,693 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 05:35:08,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 234 [2021-08-27 05:35:08,705 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 05:35:08,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 306 treesize of output 310 [2021-08-27 05:35:09,176 INFO L354 Elim1Store]: treesize reduction 64, result has 17.9 percent of original size [2021-08-27 05:35:09,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 135 [2021-08-27 05:35:09,197 INFO L354 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2021-08-27 05:35:09,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 165 treesize of output 154 [2021-08-27 05:35:09,206 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 05:35:09,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 234 [2021-08-27 05:35:09,215 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 05:35:09,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 262 [2021-08-27 05:35:09,448 INFO L354 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2021-08-27 05:35:09,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 125 [2021-08-27 05:35:09,461 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-08-27 05:35:09,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 146 [2021-08-27 05:35:09,469 INFO L388 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 190 treesize of output 180 [2021-08-27 05:35:09,475 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-08-27 05:35:09,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 175 [2021-08-27 05:35:09,484 INFO L388 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 181 treesize of output 177 [2021-08-27 05:35:09,490 INFO L354 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-08-27 05:35:09,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 174 [2021-08-27 05:35:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:35:09,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16964366] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:35:09,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 05:35:09,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [23] total 29 [2021-08-27 05:35:09,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871988938] [2021-08-27 05:35:09,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 05:35:09,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:35:09,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 05:35:09,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2021-08-27 05:35:09,583 INFO L87 Difference]: Start difference. First operand 501 states and 620 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:35:10,738 INFO L93 Difference]: Finished difference Result 572 states and 656 transitions. [2021-08-27 05:35:10,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 05:35:10,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-08-27 05:35:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:35:10,740 INFO L225 Difference]: With dead ends: 572 [2021-08-27 05:35:10,740 INFO L226 Difference]: Without dead ends: 572 [2021-08-27 05:35:10,741 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 20 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1259.8ms TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2021-08-27 05:35:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-08-27 05:35:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 497. [2021-08-27 05:35:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 425 states have (on average 1.4352941176470588) internal successors, (610), 493 states have internal predecessors, (610), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 613 transitions. [2021-08-27 05:35:10,745 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 613 transitions. Word has length 68 [2021-08-27 05:35:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:35:10,745 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 613 transitions. [2021-08-27 05:35:10,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 613 transitions. [2021-08-27 05:35:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-27 05:35:10,746 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:35:10,746 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:35:10,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-27 05:35:10,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-08-27 05:35:10,947 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:35:10,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:35:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1425484446, now seen corresponding path program 1 times [2021-08-27 05:35:10,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:35:10,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706752501] [2021-08-27 05:35:10,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:35:10,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:35:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:35:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-27 05:35:11,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:35:11,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706752501] [2021-08-27 05:35:11,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706752501] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:35:11,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:35:11,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:35:11,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898655012] [2021-08-27 05:35:11,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:35:11,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:35:11,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:35:11,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:35:11,028 INFO L87 Difference]: Start difference. First operand 497 states and 613 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:35:11,330 INFO L93 Difference]: Finished difference Result 498 states and 612 transitions. [2021-08-27 05:35:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:35:11,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2021-08-27 05:35:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:35:11,332 INFO L225 Difference]: With dead ends: 498 [2021-08-27 05:35:11,332 INFO L226 Difference]: Without dead ends: 498 [2021-08-27 05:35:11,332 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.8ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:35:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-08-27 05:35:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 497. [2021-08-27 05:35:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 425 states have (on average 1.4305882352941177) internal successors, (608), 493 states have internal predecessors, (608), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 611 transitions. [2021-08-27 05:35:11,336 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 611 transitions. Word has length 70 [2021-08-27 05:35:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:35:11,336 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 611 transitions. [2021-08-27 05:35:11,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 611 transitions. [2021-08-27 05:35:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-27 05:35:11,337 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:35:11,337 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:35:11,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-27 05:35:11,337 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:35:11,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:35:11,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1662980003, now seen corresponding path program 1 times [2021-08-27 05:35:11,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:35:11,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496220671] [2021-08-27 05:35:11,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:35:11,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:35:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:11,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:35:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-27 05:35:11,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:35:11,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496220671] [2021-08-27 05:35:11,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496220671] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:35:11,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:35:11,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:35:11,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914995860] [2021-08-27 05:35:11,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:35:11,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:35:11,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:35:11,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:35:11,400 INFO L87 Difference]: Start difference. First operand 497 states and 611 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:35:11,697 INFO L93 Difference]: Finished difference Result 503 states and 618 transitions. [2021-08-27 05:35:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:35:11,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2021-08-27 05:35:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:35:11,698 INFO L225 Difference]: With dead ends: 503 [2021-08-27 05:35:11,698 INFO L226 Difference]: Without dead ends: 503 [2021-08-27 05:35:11,699 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.6ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:35:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-08-27 05:35:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2021-08-27 05:35:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 429 states have (on average 1.4289044289044288) internal successors, (613), 497 states have internal predecessors, (613), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 616 transitions. [2021-08-27 05:35:11,702 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 616 transitions. Word has length 72 [2021-08-27 05:35:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:35:11,702 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 616 transitions. [2021-08-27 05:35:11,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 616 transitions. [2021-08-27 05:35:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 05:35:11,703 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:35:11,703 INFO L512 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1] [2021-08-27 05:35:11,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-08-27 05:35:11,703 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting mainErr123REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:35:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:35:11,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1353680858, now seen corresponding path program 1 times [2021-08-27 05:35:11,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:35:11,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048521263] [2021-08-27 05:35:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:35:11,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:35:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:11,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:35:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 05:35:11,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:35:11,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048521263] [2021-08-27 05:35:11,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048521263] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:35:11,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:35:11,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 05:35:11,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369238010] [2021-08-27 05:35:11,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:35:11,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:35:11,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:35:11,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:35:11,785 INFO L87 Difference]: Start difference. First operand 501 states and 616 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:35:12,080 INFO L93 Difference]: Finished difference Result 499 states and 607 transitions. [2021-08-27 05:35:12,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:35:12,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-08-27 05:35:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:35:12,082 INFO L225 Difference]: With dead ends: 499 [2021-08-27 05:35:12,082 INFO L226 Difference]: Without dead ends: 499 [2021-08-27 05:35:12,082 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.2ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:35:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-08-27 05:35:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2021-08-27 05:35:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 423 states have (on average 1.4184397163120568) internal successors, (600), 491 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 603 transitions. [2021-08-27 05:35:12,086 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 603 transitions. Word has length 73 [2021-08-27 05:35:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:35:12,086 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 603 transitions. [2021-08-27 05:35:12,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 603 transitions. [2021-08-27 05:35:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-27 05:35:12,087 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:35:12,087 INFO L512 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:35:12,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-08-27 05:35:12,087 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting mainErr143REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:35:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:35:12,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1841314093, now seen corresponding path program 1 times [2021-08-27 05:35:12,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:35:12,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606671913] [2021-08-27 05:35:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:35:12,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:35:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:12,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:35:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:35:12,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:35:12,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606671913] [2021-08-27 05:35:12,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606671913] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:35:12,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880829912] [2021-08-27 05:35:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:35:12,674 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:35:12,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:35:12,675 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:35:12,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-27 05:35:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:14,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-27 05:35:14,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:35:14,524 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-08-27 05:35:14,524 INFO L388 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 2 case distinctions, treesize of input 21 treesize of output 24 [2021-08-27 05:35:14,624 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-08-27 05:35:14,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2021-08-27 05:35:14,696 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-27 05:35:14,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-08-27 05:35:14,810 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-27 05:35:14,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-08-27 05:35:14,989 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 05:35:14,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-08-27 05:35:15,083 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-08-27 05:35:15,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2021-08-27 05:35:15,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2021-08-27 05:35:15,235 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-27 05:35:15,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-08-27 05:35:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:35:15,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880829912] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:35:15,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 05:35:15,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [27] total 35 [2021-08-27 05:35:15,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439883924] [2021-08-27 05:35:15,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 05:35:15,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:35:15,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 05:35:15,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-27 05:35:15,322 INFO L87 Difference]: Start difference. First operand 495 states and 603 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:35:16,094 INFO L93 Difference]: Finished difference Result 833 states and 1013 transitions. [2021-08-27 05:35:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 05:35:16,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2021-08-27 05:35:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:35:16,096 INFO L225 Difference]: With dead ends: 833 [2021-08-27 05:35:16,096 INFO L226 Difference]: Without dead ends: 833 [2021-08-27 05:35:16,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 852.4ms TimeCoverageRelationStatistics Valid=145, Invalid=1747, Unknown=0, NotChecked=0, Total=1892 [2021-08-27 05:35:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-08-27 05:35:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 580. [2021-08-27 05:35:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 508 states have (on average 1.4271653543307086) internal successors, (725), 576 states have internal predecessors, (725), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 728 transitions. [2021-08-27 05:35:16,102 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 728 transitions. Word has length 76 [2021-08-27 05:35:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:35:16,102 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 728 transitions. [2021-08-27 05:35:16,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 728 transitions. [2021-08-27 05:35:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-27 05:35:16,103 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:35:16,103 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-08-27 05:35:16,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-27 05:35:16,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-08-27 05:35:16,317 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting mainErr50REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:35:16,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:35:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash -656365457, now seen corresponding path program 2 times [2021-08-27 05:35:16,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:35:16,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862756976] [2021-08-27 05:35:16,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:35:16,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:35:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:18,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:35:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:35:18,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:35:18,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862756976] [2021-08-27 05:35:18,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862756976] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:35:18,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888945797] [2021-08-27 05:35:18,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 05:35:18,055 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:35:18,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:35:18,056 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:35:18,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-27 05:35:20,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 05:35:20,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 05:35:20,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 93 conjunts are in the unsatisfiable core [2021-08-27 05:35:20,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:35:20,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:35:20,060 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 05:35:20,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 05:35:20,144 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-08-27 05:35:20,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2021-08-27 05:35:20,226 INFO L388 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 17 treesize of output 13 [2021-08-27 05:35:20,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:20,295 INFO L388 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 28 treesize of output 27 [2021-08-27 05:35:20,469 INFO L354 Elim1Store]: treesize reduction 118, result has 27.2 percent of original size [2021-08-27 05:35:20,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 61 [2021-08-27 05:35:20,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2021-08-27 05:35:20,720 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-27 05:35:20,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 45 [2021-08-27 05:35:20,897 INFO L354 Elim1Store]: treesize reduction 136, result has 28.0 percent of original size [2021-08-27 05:35:20,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 40 treesize of output 73 [2021-08-27 05:35:21,119 INFO L354 Elim1Store]: treesize reduction 59, result has 13.2 percent of original size [2021-08-27 05:35:21,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 73 [2021-08-27 05:35:21,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:21,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 05:35:21,319 INFO L354 Elim1Store]: treesize reduction 100, result has 14.5 percent of original size [2021-08-27 05:35:21,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 93 [2021-08-27 05:35:21,347 INFO L388 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 13 treesize of output 9 [2021-08-27 05:35:21,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:21,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:21,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:21,847 INFO L354 Elim1Store]: treesize reduction 166, result has 17.8 percent of original size [2021-08-27 05:35:21,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 70 [2021-08-27 05:35:21,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:21,999 INFO L388 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 19 treesize of output 18 [2021-08-27 05:35:22,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:22,053 INFO L354 Elim1Store]: treesize reduction 140, result has 19.5 percent of original size [2021-08-27 05:35:22,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 154 treesize of output 113 [2021-08-27 05:35:22,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 05:35:22,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 05:35:22,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2021-08-27 05:35:22,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835429566] [2021-08-27 05:35:22,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-08-27 05:35:22,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:35:22,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-08-27 05:35:22,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2865, Unknown=0, NotChecked=0, Total=3080 [2021-08-27 05:35:22,526 INFO L87 Difference]: Start difference. First operand 580 states and 728 transitions. Second operand has 41 states, 40 states have (on average 1.875) internal successors, (75), 40 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:35:31,560 INFO L93 Difference]: Finished difference Result 646 states and 803 transitions. [2021-08-27 05:35:31,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-08-27 05:35:31,564 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 40 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-08-27 05:35:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:35:31,566 INFO L225 Difference]: With dead ends: 646 [2021-08-27 05:35:31,566 INFO L226 Difference]: Without dead ends: 646 [2021-08-27 05:35:31,567 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 7271.1ms TimeCoverageRelationStatistics Valid=948, Invalid=7608, Unknown=0, NotChecked=0, Total=8556 [2021-08-27 05:35:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2021-08-27 05:35:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 584. [2021-08-27 05:35:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 512 states have (on average 1.427734375) internal successors, (731), 580 states have internal predecessors, (731), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 734 transitions. [2021-08-27 05:35:31,571 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 734 transitions. Word has length 78 [2021-08-27 05:35:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:35:31,571 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 734 transitions. [2021-08-27 05:35:31,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 40 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:35:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 734 transitions. [2021-08-27 05:35:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-27 05:35:31,572 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:35:31,572 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-08-27 05:35:31,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-27 05:35:31,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-08-27 05:35:31,791 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting mainErr51REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:35:31,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:35:31,791 INFO L82 PathProgramCache]: Analyzing trace with hash -656365456, now seen corresponding path program 1 times [2021-08-27 05:35:31,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:35:31,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236411097] [2021-08-27 05:35:31,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:35:31,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:35:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:33,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:35:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:35:33,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:35:33,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236411097] [2021-08-27 05:35:33,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236411097] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:35:33,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459763807] [2021-08-27 05:35:33,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:35:33,534 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:35:33,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:35:33,534 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:35:33,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-27 05:35:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:35:35,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 91 conjunts are in the unsatisfiable core [2021-08-27 05:35:35,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:35:35,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:35:35,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:35:35,674 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 05:35:35,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2021-08-27 05:35:35,681 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 05:35:35,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-08-27 05:35:35,842 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-08-27 05:35:35,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2021-08-27 05:35:35,858 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-08-27 05:35:35,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2021-08-27 05:35:35,989 INFO L388 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 13 treesize of output 9 [2021-08-27 05:35:35,996 INFO L388 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 38 treesize of output 34 [2021-08-27 05:35:36,257 INFO L354 Elim1Store]: treesize reduction 96, result has 18.6 percent of original size [2021-08-27 05:35:36,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 78 [2021-08-27 05:35:36,297 INFO L354 Elim1Store]: treesize reduction 108, result has 27.0 percent of original size [2021-08-27 05:35:36,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 93 [2021-08-27 05:35:36,464 INFO L388 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 23 treesize of output 22 [2021-08-27 05:35:36,472 INFO L388 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 70 treesize of output 51 [2021-08-27 05:35:36,662 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-27 05:35:36,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 54 [2021-08-27 05:35:36,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:36,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2021-08-27 05:35:36,797 INFO L354 Elim1Store]: treesize reduction 134, result has 26.8 percent of original size [2021-08-27 05:35:36,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 84 treesize of output 115 [2021-08-27 05:35:36,842 INFO L354 Elim1Store]: treesize reduction 118, result has 18.6 percent of original size [2021-08-27 05:35:36,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 111 [2021-08-27 05:35:37,121 INFO L354 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2021-08-27 05:35:37,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 140 [2021-08-27 05:35:37,134 INFO L354 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2021-08-27 05:35:37,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 113 [2021-08-27 05:35:37,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:37,348 INFO L354 Elim1Store]: treesize reduction 132, result has 14.8 percent of original size [2021-08-27 05:35:37,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 155 [2021-08-27 05:35:37,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:37,370 INFO L354 Elim1Store]: treesize reduction 152, result has 15.1 percent of original size [2021-08-27 05:35:37,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 252 treesize of output 256 [2021-08-27 05:35:37,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:37,955 INFO L354 Elim1Store]: treesize reduction 96, result has 26.7 percent of original size [2021-08-27 05:35:37,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 136 treesize of output 136 [2021-08-27 05:35:37,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:35:37,992 INFO L354 Elim1Store]: treesize reduction 190, result has 17.0 percent of original size [2021-08-27 05:35:37,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 118 treesize of output 132 [2021-08-27 05:35:38,207 INFO L354 Elim1Store]: treesize reduction 228, result has 15.2 percent of original size [2021-08-27 05:35:38,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 262 treesize of output 172 [2021-08-27 05:35:38,246 INFO L354 Elim1Store]: treesize reduction 292, result has 15.4 percent of original size [2021-08-27 05:35:38,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 379 treesize of output 345 [2021-08-27 05:35:38,665 INFO L354 Elim1Store]: treesize reduction 240, result has 13.0 percent of original size [2021-08-27 05:35:38,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 401 treesize of output 199 [2021-08-27 05:35:38,722 INFO L354 Elim1Store]: treesize reduction 400, result has 13.0 percent of original size [2021-08-27 05:35:38,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 388 treesize of output 357 [2021-08-27 05:35:39,475 INFO L354 Elim1Store]: treesize reduction 240, result has 13.0 percent of original size [2021-08-27 05:35:39,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 401 treesize of output 199 [2021-08-27 05:35:39,537 INFO L354 Elim1Store]: treesize reduction 400, result has 13.0 percent of original size [2021-08-27 05:35:39,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 388 treesize of output 357 [2021-08-27 05:35:40,249 INFO L354 Elim1Store]: treesize reduction 328, result has 11.4 percent of original size [2021-08-27 05:35:40,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 425 treesize of output 211 [2021-08-27 05:35:40,308 INFO L354 Elim1Store]: treesize reduction 348, result has 10.3 percent of original size [2021-08-27 05:35:40,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 285 treesize of output 265 [2021-08-27 05:35:41,098 INFO L354 Elim1Store]: treesize reduction 296, result has 12.9 percent of original size [2021-08-27 05:35:41,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 288 treesize of output 277 [2021-08-27 05:35:41,151 INFO L354 Elim1Store]: treesize reduction 324, result has 12.9 percent of original size [2021-08-27 05:35:41,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 275 treesize of output 184 [2021-08-27 05:35:43,156 INFO L354 Elim1Store]: treesize reduction 296, result has 12.9 percent of original size [2021-08-27 05:35:43,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 288 treesize of output 277 [2021-08-27 05:35:43,213 INFO L354 Elim1Store]: treesize reduction 324, result has 12.9 percent of original size [2021-08-27 05:35:43,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 275 treesize of output 184 [2021-08-27 05:35:44,368 INFO L354 Elim1Store]: treesize reduction 380, result has 11.2 percent of original size [2021-08-27 05:35:44,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 312 treesize of output 287 [2021-08-27 05:35:44,436 INFO L354 Elim1Store]: treesize reduction 426, result has 9.4 percent of original size [2021-08-27 05:35:44,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 297 treesize of output 187 [2021-08-27 05:35:44,867 INFO L354 Elim1Store]: treesize reduction 156, result has 0.6 percent of original size [2021-08-27 05:35:44,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 301 treesize of output 149 [2021-08-27 05:35:44,889 INFO L354 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2021-08-27 05:35:44,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 134 treesize of output 106 [2021-08-27 05:35:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:35:45,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459763807] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:35:45,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:35:45,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22] total 52 [2021-08-27 05:35:45,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340278200] [2021-08-27 05:35:45,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-08-27 05:35:45,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:35:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-27 05:35:45,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-08-27 05:35:45,077 INFO L87 Difference]: Start difference. First operand 584 states and 734 transitions. Second operand has 53 states, 52 states have (on average 2.769230769230769) internal successors, (144), 52 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:01,443 WARN L224 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-08-27 05:37:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-27 05:37:01,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-08-27 05:37:01,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-08-27 05:37:01,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:37:01,644 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:174) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:778) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:235) ... 56 more [2021-08-27 05:37:01,647 INFO L168 Benchmark]: Toolchain (without parser) took 293619.10 ms. Allocated memory was 48.2 MB in the beginning and 861.9 MB in the end (delta: 813.7 MB). Free memory was 22.7 MB in the beginning and 408.3 MB in the end (delta: -385.6 MB). Peak memory consumption was 428.0 MB. Max. memory is 16.1 GB. [2021-08-27 05:37:01,648 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 48.2 MB. Free memory is still 30.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:37:01,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.23 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 22.5 MB in the beginning and 33.6 MB in the end (delta: -11.1 MB). Peak memory consumption was 3.8 MB. Max. memory is 16.1 GB. [2021-08-27 05:37:01,648 INFO L168 Benchmark]: Boogie Preprocessor took 84.39 ms. Allocated memory is still 58.7 MB. Free memory was 33.6 MB in the beginning and 40.5 MB in the end (delta: -6.9 MB). Peak memory consumption was 8.1 MB. Max. memory is 16.1 GB. [2021-08-27 05:37:01,648 INFO L168 Benchmark]: RCFGBuilder took 917.70 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 40.5 MB in the beginning and 60.8 MB in the end (delta: -20.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 16.1 GB. [2021-08-27 05:37:01,648 INFO L168 Benchmark]: TraceAbstraction took 292232.75 ms. Allocated memory was 86.0 MB in the beginning and 861.9 MB in the end (delta: 775.9 MB). Free memory was 60.3 MB in the beginning and 408.3 MB in the end (delta: -348.0 MB). Peak memory consumption was 428.2 MB. Max. memory is 16.1 GB. [2021-08-27 05:37:01,649 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 48.2 MB. Free memory is still 30.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 377.23 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 22.5 MB in the beginning and 33.6 MB in the end (delta: -11.1 MB). Peak memory consumption was 3.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 84.39 ms. Allocated memory is still 58.7 MB. Free memory was 33.6 MB in the beginning and 40.5 MB in the end (delta: -6.9 MB). Peak memory consumption was 8.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 917.70 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 40.5 MB in the beginning and 60.8 MB in the end (delta: -20.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 292232.75 ms. Allocated memory was 86.0 MB in the beginning and 861.9 MB in the end (delta: 775.9 MB). Free memory was 60.3 MB in the beginning and 408.3 MB in the end (delta: -348.0 MB). Peak memory consumption was 428.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 05:37:02,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 05:37:02,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 05:37:03,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 05:37:03,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 05:37:03,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 05:37:03,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 05:37:03,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 05:37:03,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 05:37:03,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 05:37:03,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 05:37:03,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 05:37:03,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 05:37:03,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 05:37:03,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 05:37:03,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 05:37:03,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 05:37:03,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 05:37:03,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 05:37:03,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 05:37:03,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 05:37:03,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 05:37:03,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 05:37:03,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 05:37:03,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 05:37:03,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 05:37:03,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 05:37:03,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 05:37:03,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 05:37:03,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 05:37:03,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 05:37:03,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 05:37:03,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 05:37:03,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 05:37:03,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 05:37:03,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 05:37:03,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 05:37:03,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 05:37:03,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 05:37:03,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 05:37:03,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 05:37:03,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 05:37:03,082 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 05:37:03,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 05:37:03,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 05:37:03,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 05:37:03,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 05:37:03,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 05:37:03,085 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 05:37:03,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 05:37:03,086 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 05:37:03,086 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 05:37:03,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 05:37:03,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 05:37:03,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 05:37:03,087 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 05:37:03,087 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 05:37:03,087 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 05:37:03,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 05:37:03,087 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 05:37:03,088 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 05:37:03,088 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 05:37:03,088 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 05:37:03,088 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 05:37:03,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 05:37:03,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 05:37:03,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 05:37:03,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:37:03,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 05:37:03,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 05:37:03,089 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 05:37:03,089 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 05:37:03,089 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 05:37:03,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 05:37:03,090 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 55e080b379cbe2b1b2a29d34ca4914126366bc9d [2021-08-27 05:37:03,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 05:37:03,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 05:37:03,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 05:37:03,369 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 05:37:03,370 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 05:37:03,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0521.i [2021-08-27 05:37:03,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/135ae189e/ce5db8ee1c94428eb1a42ef541493da5/FLAGe5e6ea58f [2021-08-27 05:37:03,780 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 05:37:03,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2021-08-27 05:37:03,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/135ae189e/ce5db8ee1c94428eb1a42ef541493da5/FLAGe5e6ea58f [2021-08-27 05:37:04,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/135ae189e/ce5db8ee1c94428eb1a42ef541493da5 [2021-08-27 05:37:04,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 05:37:04,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 05:37:04,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 05:37:04,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 05:37:04,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 05:37:04,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:37:04" (1/1) ... [2021-08-27 05:37:04,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@451596ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:04, skipping insertion in model container [2021-08-27 05:37:04,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:37:04" (1/1) ... [2021-08-27 05:37:04,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 05:37:04,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 05:37:04,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:37:04,481 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 05:37:04,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:37:04,539 INFO L208 MainTranslator]: Completed translation [2021-08-27 05:37:04,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:04 WrapperNode [2021-08-27 05:37:04,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 05:37:04,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 05:37:04,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 05:37:04,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 05:37:04,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:04" (1/1) ... [2021-08-27 05:37:04,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:04" (1/1) ... [2021-08-27 05:37:04,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:04" (1/1) ... [2021-08-27 05:37:04,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:04" (1/1) ... [2021-08-27 05:37:04,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:04" (1/1) ... [2021-08-27 05:37:04,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:04" (1/1) ... [2021-08-27 05:37:04,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:04" (1/1) ... [2021-08-27 05:37:04,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 05:37:04,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 05:37:04,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 05:37:04,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 05:37:04,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:04" (1/1) ... [2021-08-27 05:37:04,635 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:37:04,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:37:04,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 05:37:04,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 05:37:04,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 05:37:04,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 05:37:04,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 05:37:04,701 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 05:37:04,701 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 05:37:04,701 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 05:37:04,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 05:37:04,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 05:37:04,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 05:37:04,702 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 05:37:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 05:37:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 05:37:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 05:37:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 05:37:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 05:37:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 05:37:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 05:37:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 05:37:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 05:37:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 05:37:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 05:37:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 05:37:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 05:37:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 05:37:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 05:37:04,704 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 05:37:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 05:37:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 05:37:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 05:37:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 05:37:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 05:37:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 05:37:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 05:37:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 05:37:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 05:37:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 05:37:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 05:37:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 05:37:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 05:37:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 05:37:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 05:37:04,707 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 05:37:04,707 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 05:37:04,707 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 05:37:04,713 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 05:37:04,714 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 05:37:04,714 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 05:37:04,714 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 05:37:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 05:37:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 05:37:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 05:37:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 05:37:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 05:37:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 05:37:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 05:37:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 05:37:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 05:37:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 05:37:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 05:37:04,717 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 05:37:04,717 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 05:37:04,717 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 05:37:04,717 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 05:37:04,717 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 05:37:04,718 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 05:37:04,718 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 05:37:04,718 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 05:37:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 05:37:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 05:37:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 05:37:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 05:37:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 05:37:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 05:37:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 05:37:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 05:37:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 05:37:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 05:37:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 05:37:04,721 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 05:37:04,721 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 05:37:04,721 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 05:37:04,721 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 05:37:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 05:37:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 05:37:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 05:37:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 05:37:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 05:37:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 05:37:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 05:37:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 05:37:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 05:37:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 05:37:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 05:37:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 05:37:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 05:37:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 05:37:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 05:37:04,724 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 05:37:04,724 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 05:37:04,724 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 05:37:04,724 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 05:37:04,724 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 05:37:04,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 05:37:04,724 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 05:37:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 05:37:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 05:37:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 05:37:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 05:37:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 05:37:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 05:37:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 05:37:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 05:37:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 05:37:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 05:37:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 05:37:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 05:37:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 05:37:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 05:37:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 05:37:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 05:37:04,728 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 05:37:04,728 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 05:37:04,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 05:37:04,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 05:37:04,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 05:37:04,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 05:37:04,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 05:37:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 05:37:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 05:37:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 05:37:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 05:37:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 05:37:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 05:37:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 05:37:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 05:37:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 05:37:04,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 05:37:05,912 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 05:37:05,912 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-27 05:37:05,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:37:05 BoogieIcfgContainer [2021-08-27 05:37:05,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 05:37:05,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 05:37:05,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 05:37:05,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 05:37:05,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 05:37:04" (1/3) ... [2021-08-27 05:37:05,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c890ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:37:05, skipping insertion in model container [2021-08-27 05:37:05,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:04" (2/3) ... [2021-08-27 05:37:05,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c890ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:37:05, skipping insertion in model container [2021-08-27 05:37:05,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:37:05" (3/3) ... [2021-08-27 05:37:05,920 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0521.i [2021-08-27 05:37:05,923 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 05:37:05,924 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2021-08-27 05:37:05,960 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 05:37:05,965 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 05:37:05,965 INFO L340 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2021-08-27 05:37:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 314 states, 157 states have (on average 2.2038216560509554) internal successors, (346), 309 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 05:37:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:37:06,000 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:06,001 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:06,001 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:06,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1178268032, now seen corresponding path program 1 times [2021-08-27 05:37:06,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:06,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735275723] [2021-08-27 05:37:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:06,013 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:06,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:06,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:06,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 05:37:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:06,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-27 05:37:06,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:06,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:06,279 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:06,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735275723] [2021-08-27 05:37:06,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735275723] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:06,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:06,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:37:06,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370686306] [2021-08-27 05:37:06,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 05:37:06,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:06,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 05:37:06,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 05:37:06,298 INFO L87 Difference]: Start difference. First operand has 314 states, 157 states have (on average 2.2038216560509554) internal successors, (346), 309 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:06,335 INFO L93 Difference]: Finished difference Result 314 states and 340 transitions. [2021-08-27 05:37:06,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 05:37:06,336 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 05:37:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:06,348 INFO L225 Difference]: With dead ends: 314 [2021-08-27 05:37:06,348 INFO L226 Difference]: Without dead ends: 311 [2021-08-27 05:37:06,349 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 05:37:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-08-27 05:37:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2021-08-27 05:37:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 156 states have (on average 2.141025641025641) internal successors, (334), 307 states have internal predecessors, (334), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 337 transitions. [2021-08-27 05:37:06,380 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 337 transitions. Word has length 9 [2021-08-27 05:37:06,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:06,381 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 337 transitions. [2021-08-27 05:37:06,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 337 transitions. [2021-08-27 05:37:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:37:06,381 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:06,381 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:06,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:06,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:06,588 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:06,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:06,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1178296862, now seen corresponding path program 1 times [2021-08-27 05:37:06,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:06,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878899729] [2021-08-27 05:37:06,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:06,589 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:06,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:06,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:06,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 05:37:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:06,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 05:37:06,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:06,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:06,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:06,811 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:06,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878899729] [2021-08-27 05:37:06,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878899729] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:06,811 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:06,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:37:06,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351210569] [2021-08-27 05:37:06,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:37:06,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:06,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:37:06,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:37:06,813 INFO L87 Difference]: Start difference. First operand 311 states and 337 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:07,192 INFO L93 Difference]: Finished difference Result 295 states and 321 transitions. [2021-08-27 05:37:07,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:37:07,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 05:37:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:07,194 INFO L225 Difference]: With dead ends: 295 [2021-08-27 05:37:07,194 INFO L226 Difference]: Without dead ends: 295 [2021-08-27 05:37:07,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:37:07,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-08-27 05:37:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2021-08-27 05:37:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 156 states have (on average 2.0384615384615383) internal successors, (318), 291 states have internal predecessors, (318), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 321 transitions. [2021-08-27 05:37:07,203 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 321 transitions. Word has length 9 [2021-08-27 05:37:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:07,203 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 321 transitions. [2021-08-27 05:37:07,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 321 transitions. [2021-08-27 05:37:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:37:07,204 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:07,204 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:07,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:07,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:07,410 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:07,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1178296861, now seen corresponding path program 1 times [2021-08-27 05:37:07,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:07,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715522962] [2021-08-27 05:37:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:07,412 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:07,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:07,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:07,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 05:37:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:07,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 05:37:07,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:07,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:07,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:07,635 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:07,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715522962] [2021-08-27 05:37:07,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715522962] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:07,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:07,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 05:37:07,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584007896] [2021-08-27 05:37:07,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:37:07,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:07,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:37:07,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:37:07,637 INFO L87 Difference]: Start difference. First operand 295 states and 321 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:08,352 INFO L93 Difference]: Finished difference Result 279 states and 305 transitions. [2021-08-27 05:37:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:37:08,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 05:37:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:08,355 INFO L225 Difference]: With dead ends: 279 [2021-08-27 05:37:08,355 INFO L226 Difference]: Without dead ends: 279 [2021-08-27 05:37:08,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:37:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-08-27 05:37:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2021-08-27 05:37:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 156 states have (on average 1.935897435897436) internal successors, (302), 275 states have internal predecessors, (302), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 305 transitions. [2021-08-27 05:37:08,362 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 305 transitions. Word has length 9 [2021-08-27 05:37:08,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:08,362 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 305 transitions. [2021-08-27 05:37:08,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 305 transitions. [2021-08-27 05:37:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:37:08,363 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:08,363 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:08,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:08,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:08,571 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:08,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1178295739, now seen corresponding path program 1 times [2021-08-27 05:37:08,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:08,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112848694] [2021-08-27 05:37:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:08,572 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:08,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:08,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:08,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 05:37:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:08,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 05:37:08,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:08,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:08,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:08,795 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:08,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112848694] [2021-08-27 05:37:08,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112848694] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:08,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:08,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:37:08,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399690194] [2021-08-27 05:37:08,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:37:08,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:08,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:37:08,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:37:08,797 INFO L87 Difference]: Start difference. First operand 279 states and 305 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:09,202 INFO L93 Difference]: Finished difference Result 333 states and 368 transitions. [2021-08-27 05:37:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:37:09,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 05:37:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:09,204 INFO L225 Difference]: With dead ends: 333 [2021-08-27 05:37:09,204 INFO L226 Difference]: Without dead ends: 333 [2021-08-27 05:37:09,205 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:37:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-08-27 05:37:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 277. [2021-08-27 05:37:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 156 states have (on average 1.9230769230769231) internal successors, (300), 273 states have internal predecessors, (300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 303 transitions. [2021-08-27 05:37:09,219 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 303 transitions. Word has length 9 [2021-08-27 05:37:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:09,219 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 303 transitions. [2021-08-27 05:37:09,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 303 transitions. [2021-08-27 05:37:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:37:09,220 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:09,220 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:09,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:09,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:09,420 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1178295738, now seen corresponding path program 1 times [2021-08-27 05:37:09,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:09,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815160981] [2021-08-27 05:37:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:09,421 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:09,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:09,422 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:09,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 05:37:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:09,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 05:37:09,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:09,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:09,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:09,645 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:09,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815160981] [2021-08-27 05:37:09,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815160981] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:09,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:09,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 05:37:09,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329924693] [2021-08-27 05:37:09,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:37:09,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:09,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:37:09,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:37:09,647 INFO L87 Difference]: Start difference. First operand 277 states and 303 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:10,469 INFO L93 Difference]: Finished difference Result 465 states and 513 transitions. [2021-08-27 05:37:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:37:10,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 05:37:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:10,471 INFO L225 Difference]: With dead ends: 465 [2021-08-27 05:37:10,471 INFO L226 Difference]: Without dead ends: 465 [2021-08-27 05:37:10,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:37:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-08-27 05:37:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 275. [2021-08-27 05:37:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 156 states have (on average 1.9102564102564104) internal successors, (298), 271 states have internal predecessors, (298), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2021-08-27 05:37:10,476 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 9 [2021-08-27 05:37:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:10,476 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2021-08-27 05:37:10,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2021-08-27 05:37:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 05:37:10,477 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:10,477 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:10,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:10,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:10,683 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:10,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:10,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1528083427, now seen corresponding path program 1 times [2021-08-27 05:37:10,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:10,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121200949] [2021-08-27 05:37:10,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:10,684 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:10,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:10,685 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:10,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 05:37:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:10,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 05:37:10,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:10,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:10,948 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:10,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121200949] [2021-08-27 05:37:10,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121200949] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:10,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:10,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 05:37:10,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26812577] [2021-08-27 05:37:10,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:37:10,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:10,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:37:10,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:37:10,949 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:11,026 INFO L93 Difference]: Finished difference Result 672 states and 738 transitions. [2021-08-27 05:37:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:37:11,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-27 05:37:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:11,028 INFO L225 Difference]: With dead ends: 672 [2021-08-27 05:37:11,028 INFO L226 Difference]: Without dead ends: 672 [2021-08-27 05:37:11,029 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:37:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-08-27 05:37:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 279. [2021-08-27 05:37:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 160 states have (on average 1.89375) internal successors, (303), 275 states have internal predecessors, (303), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 306 transitions. [2021-08-27 05:37:11,034 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 306 transitions. Word has length 11 [2021-08-27 05:37:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:11,034 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 306 transitions. [2021-08-27 05:37:11,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 306 transitions. [2021-08-27 05:37:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 05:37:11,034 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:11,034 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:11,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:11,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:11,237 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:11,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:11,237 INFO L82 PathProgramCache]: Analyzing trace with hash 645675658, now seen corresponding path program 1 times [2021-08-27 05:37:11,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:11,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008152669] [2021-08-27 05:37:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:11,238 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:11,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:11,238 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:11,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 05:37:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:11,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 05:37:11,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:11,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:11,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:11,451 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:11,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008152669] [2021-08-27 05:37:11,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008152669] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:11,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:11,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:37:11,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168501766] [2021-08-27 05:37:11,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:37:11,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:11,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:37:11,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:37:11,453 INFO L87 Difference]: Start difference. First operand 279 states and 306 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:11,802 INFO L93 Difference]: Finished difference Result 328 states and 362 transitions. [2021-08-27 05:37:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:37:11,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 05:37:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:11,803 INFO L225 Difference]: With dead ends: 328 [2021-08-27 05:37:11,803 INFO L226 Difference]: Without dead ends: 328 [2021-08-27 05:37:11,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:37:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-08-27 05:37:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 277. [2021-08-27 05:37:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 160 states have (on average 1.88125) internal successors, (301), 273 states have internal predecessors, (301), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 304 transitions. [2021-08-27 05:37:11,807 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 304 transitions. Word has length 13 [2021-08-27 05:37:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:11,807 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 304 transitions. [2021-08-27 05:37:11,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 304 transitions. [2021-08-27 05:37:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 05:37:11,807 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:11,807 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:11,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:12,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:12,008 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:12,008 INFO L82 PathProgramCache]: Analyzing trace with hash 645675659, now seen corresponding path program 1 times [2021-08-27 05:37:12,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:12,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800101197] [2021-08-27 05:37:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:12,009 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:12,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:12,011 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:12,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 05:37:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:12,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 05:37:12,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:12,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:12,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:12,268 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:12,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800101197] [2021-08-27 05:37:12,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800101197] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:12,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:12,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 05:37:12,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367717002] [2021-08-27 05:37:12,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:37:12,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:37:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:37:12,269 INFO L87 Difference]: Start difference. First operand 277 states and 304 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:13,244 INFO L93 Difference]: Finished difference Result 464 states and 511 transitions. [2021-08-27 05:37:13,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:37:13,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 05:37:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:13,246 INFO L225 Difference]: With dead ends: 464 [2021-08-27 05:37:13,246 INFO L226 Difference]: Without dead ends: 464 [2021-08-27 05:37:13,246 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:37:13,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-27 05:37:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 275. [2021-08-27 05:37:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 160 states have (on average 1.86875) internal successors, (299), 271 states have internal predecessors, (299), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 302 transitions. [2021-08-27 05:37:13,251 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 302 transitions. Word has length 13 [2021-08-27 05:37:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:13,251 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 302 transitions. [2021-08-27 05:37:13,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 302 transitions. [2021-08-27 05:37:13,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 05:37:13,252 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:13,252 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:13,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:13,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:13,457 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:13,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:13,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1494158270, now seen corresponding path program 1 times [2021-08-27 05:37:13,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:13,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510081730] [2021-08-27 05:37:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:13,457 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:13,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:13,459 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:13,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 05:37:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:13,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 05:37:13,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:13,672 INFO L388 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 11 treesize of output 7 [2021-08-27 05:37:13,677 INFO L388 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 11 treesize of output 7 [2021-08-27 05:37:13,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-08-27 05:37:13,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-08-27 05:37:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:13,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:13,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:13,840 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:13,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510081730] [2021-08-27 05:37:13,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510081730] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:13,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:13,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-08-27 05:37:13,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521820700] [2021-08-27 05:37:13,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:37:13,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:13,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:37:13,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:37:13,841 INFO L87 Difference]: Start difference. First operand 275 states and 302 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:14,277 INFO L93 Difference]: Finished difference Result 660 states and 726 transitions. [2021-08-27 05:37:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:37:14,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 05:37:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:14,280 INFO L225 Difference]: With dead ends: 660 [2021-08-27 05:37:14,280 INFO L226 Difference]: Without dead ends: 660 [2021-08-27 05:37:14,281 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:37:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-08-27 05:37:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 278. [2021-08-27 05:37:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 163 states have (on average 1.852760736196319) internal successors, (302), 274 states have internal predecessors, (302), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 305 transitions. [2021-08-27 05:37:14,289 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 305 transitions. Word has length 16 [2021-08-27 05:37:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:14,289 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 305 transitions. [2021-08-27 05:37:14,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 305 transitions. [2021-08-27 05:37:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 05:37:14,290 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:14,290 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:14,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:14,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:14,496 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr54REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1356252692, now seen corresponding path program 1 times [2021-08-27 05:37:14,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:14,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866716612] [2021-08-27 05:37:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:14,496 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:14,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:14,497 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:14,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 05:37:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:14,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 05:37:14,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:14,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:14,853 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:14,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866716612] [2021-08-27 05:37:14,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866716612] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:14,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:14,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 05:37:14,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446834286] [2021-08-27 05:37:14,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 05:37:14,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:14,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 05:37:14,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:37:14,855 INFO L87 Difference]: Start difference. First operand 278 states and 305 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:14,998 INFO L93 Difference]: Finished difference Result 406 states and 444 transitions. [2021-08-27 05:37:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:37:14,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-08-27 05:37:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:15,000 INFO L225 Difference]: With dead ends: 406 [2021-08-27 05:37:15,000 INFO L226 Difference]: Without dead ends: 406 [2021-08-27 05:37:15,000 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:37:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-08-27 05:37:15,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 342. [2021-08-27 05:37:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 227 states have (on average 1.894273127753304) internal successors, (430), 338 states have internal predecessors, (430), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 433 transitions. [2021-08-27 05:37:15,005 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 433 transitions. Word has length 18 [2021-08-27 05:37:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:15,005 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 433 transitions. [2021-08-27 05:37:15,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 433 transitions. [2021-08-27 05:37:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 05:37:15,006 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:15,006 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:15,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:15,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:15,213 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:15,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:15,214 INFO L82 PathProgramCache]: Analyzing trace with hash -899099540, now seen corresponding path program 1 times [2021-08-27 05:37:15,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:15,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902206984] [2021-08-27 05:37:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:15,214 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:15,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:15,215 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:15,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 05:37:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:15,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 05:37:15,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:15,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:15,532 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:15,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902206984] [2021-08-27 05:37:15,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902206984] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:15,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:15,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 05:37:15,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76265495] [2021-08-27 05:37:15,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:37:15,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:15,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:37:15,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:37:15,534 INFO L87 Difference]: Start difference. First operand 342 states and 433 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:15,552 INFO L93 Difference]: Finished difference Result 327 states and 408 transitions. [2021-08-27 05:37:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:37:15,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 05:37:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:15,554 INFO L225 Difference]: With dead ends: 327 [2021-08-27 05:37:15,554 INFO L226 Difference]: Without dead ends: 327 [2021-08-27 05:37:15,554 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:37:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-08-27 05:37:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2021-08-27 05:37:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 212 states have (on average 1.9103773584905661) internal successors, (405), 323 states have internal predecessors, (405), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 408 transitions. [2021-08-27 05:37:15,560 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 408 transitions. Word has length 19 [2021-08-27 05:37:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:15,561 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 408 transitions. [2021-08-27 05:37:15,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 408 transitions. [2021-08-27 05:37:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 05:37:15,562 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:15,563 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:15,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:15,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:15,771 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr93REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1983943896, now seen corresponding path program 1 times [2021-08-27 05:37:15,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:15,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701422753] [2021-08-27 05:37:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:15,772 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:15,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:15,772 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:15,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 05:37:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:15,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 05:37:15,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:16,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:16,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:16,077 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:16,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701422753] [2021-08-27 05:37:16,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701422753] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:16,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:16,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:37:16,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938945884] [2021-08-27 05:37:16,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:37:16,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:16,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:37:16,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:37:16,082 INFO L87 Difference]: Start difference. First operand 327 states and 408 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:16,430 INFO L93 Difference]: Finished difference Result 311 states and 376 transitions. [2021-08-27 05:37:16,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:37:16,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 05:37:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:16,432 INFO L225 Difference]: With dead ends: 311 [2021-08-27 05:37:16,432 INFO L226 Difference]: Without dead ends: 311 [2021-08-27 05:37:16,432 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:37:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-08-27 05:37:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2021-08-27 05:37:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 212 states have (on average 1.759433962264151) internal successors, (373), 307 states have internal predecessors, (373), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 376 transitions. [2021-08-27 05:37:16,436 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 376 transitions. Word has length 20 [2021-08-27 05:37:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:16,436 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 376 transitions. [2021-08-27 05:37:16,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 376 transitions. [2021-08-27 05:37:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 05:37:16,436 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:16,436 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:16,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:16,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:16,637 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr94REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:16,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1983943897, now seen corresponding path program 1 times [2021-08-27 05:37:16,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:16,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84898872] [2021-08-27 05:37:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:16,637 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:16,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:16,639 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:16,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 05:37:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:16,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 05:37:16,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:16,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:16,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:16,977 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:16,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84898872] [2021-08-27 05:37:16,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84898872] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:16,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:16,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 05:37:16,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627837898] [2021-08-27 05:37:16,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:37:16,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:16,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:37:16,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:37:16,980 INFO L87 Difference]: Start difference. First operand 311 states and 376 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:17,543 INFO L93 Difference]: Finished difference Result 295 states and 344 transitions. [2021-08-27 05:37:17,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:37:17,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 05:37:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:17,544 INFO L225 Difference]: With dead ends: 295 [2021-08-27 05:37:17,544 INFO L226 Difference]: Without dead ends: 295 [2021-08-27 05:37:17,545 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:37:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-08-27 05:37:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2021-08-27 05:37:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 212 states have (on average 1.6084905660377358) internal successors, (341), 291 states have internal predecessors, (341), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 344 transitions. [2021-08-27 05:37:17,548 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 344 transitions. Word has length 20 [2021-08-27 05:37:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:17,548 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 344 transitions. [2021-08-27 05:37:17,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 344 transitions. [2021-08-27 05:37:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 05:37:17,549 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:17,549 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:17,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:17,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:17,749 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:17,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash 824848451, now seen corresponding path program 1 times [2021-08-27 05:37:17,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:17,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891412341] [2021-08-27 05:37:17,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:17,750 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:17,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:17,750 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:17,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-27 05:37:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:17,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 05:37:17,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:18,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:18,067 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 05:37:18,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2021-08-27 05:37:18,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:18,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:18,180 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:18,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891412341] [2021-08-27 05:37:18,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891412341] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:18,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:18,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-08-27 05:37:18,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237651213] [2021-08-27 05:37:18,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:37:18,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:18,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:37:18,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:37:18,181 INFO L87 Difference]: Start difference. First operand 295 states and 344 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:18,833 INFO L93 Difference]: Finished difference Result 317 states and 367 transitions. [2021-08-27 05:37:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:37:18,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 05:37:18,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:18,835 INFO L225 Difference]: With dead ends: 317 [2021-08-27 05:37:18,835 INFO L226 Difference]: Without dead ends: 317 [2021-08-27 05:37:18,835 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 56.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:37:18,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-08-27 05:37:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 297. [2021-08-27 05:37:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 293 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 349 transitions. [2021-08-27 05:37:18,846 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 349 transitions. Word has length 20 [2021-08-27 05:37:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:18,847 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 349 transitions. [2021-08-27 05:37:18,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 349 transitions. [2021-08-27 05:37:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 05:37:18,847 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:18,847 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:37:18,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:19,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:19,061 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:19,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:19,062 INFO L82 PathProgramCache]: Analyzing trace with hash 824848452, now seen corresponding path program 1 times [2021-08-27 05:37:19,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:19,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186215636] [2021-08-27 05:37:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:19,062 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:19,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:19,064 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:19,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 05:37:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:19,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 05:37:19,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:19,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:19,412 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 05:37:19,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 05:37:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:19,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:19,708 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:19,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186215636] [2021-08-27 05:37:19,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186215636] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:19,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:19,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 05:37:19,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250423862] [2021-08-27 05:37:19,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 05:37:19,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:19,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 05:37:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:37:19,709 INFO L87 Difference]: Start difference. First operand 297 states and 349 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:21,667 INFO L93 Difference]: Finished difference Result 414 states and 482 transitions. [2021-08-27 05:37:21,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:37:21,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 05:37:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:21,669 INFO L225 Difference]: With dead ends: 414 [2021-08-27 05:37:21,669 INFO L226 Difference]: Without dead ends: 414 [2021-08-27 05:37:21,670 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 335.5ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:37:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-08-27 05:37:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 296. [2021-08-27 05:37:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.5972222222222223) internal successors, (345), 292 states have internal predecessors, (345), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 348 transitions. [2021-08-27 05:37:21,674 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 348 transitions. Word has length 20 [2021-08-27 05:37:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:21,674 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 348 transitions. [2021-08-27 05:37:21,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 348 transitions. [2021-08-27 05:37:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 05:37:21,675 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:21,675 INFO L512 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] [2021-08-27 05:37:21,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:21,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:21,883 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr95REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:21,883 INFO L82 PathProgramCache]: Analyzing trace with hash -395384999, now seen corresponding path program 1 times [2021-08-27 05:37:21,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:21,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877158104] [2021-08-27 05:37:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:21,884 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:21,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:21,885 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:21,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-27 05:37:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:22,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 05:37:22,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:22,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:22,363 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:22,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877158104] [2021-08-27 05:37:22,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877158104] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:22,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:22,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 05:37:22,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47407903] [2021-08-27 05:37:22,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 05:37:22,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:22,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 05:37:22,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:37:22,364 INFO L87 Difference]: Start difference. First operand 296 states and 348 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:22,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:22,497 INFO L93 Difference]: Finished difference Result 396 states and 443 transitions. [2021-08-27 05:37:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:37:22,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 05:37:22,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:22,499 INFO L225 Difference]: With dead ends: 396 [2021-08-27 05:37:22,499 INFO L226 Difference]: Without dead ends: 396 [2021-08-27 05:37:22,499 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 41.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:37:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-08-27 05:37:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 293. [2021-08-27 05:37:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 213 states have (on average 1.591549295774648) internal successors, (339), 289 states have internal predecessors, (339), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 342 transitions. [2021-08-27 05:37:22,503 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 342 transitions. Word has length 22 [2021-08-27 05:37:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:22,503 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 342 transitions. [2021-08-27 05:37:22,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 342 transitions. [2021-08-27 05:37:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 05:37:22,503 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:22,504 INFO L512 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] [2021-08-27 05:37:22,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:22,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:22,711 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1155025758, now seen corresponding path program 1 times [2021-08-27 05:37:22,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:22,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544935759] [2021-08-27 05:37:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:22,711 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:22,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:22,712 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:22,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-27 05:37:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:22,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 05:37:22,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:23,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:23,119 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:23,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544935759] [2021-08-27 05:37:23,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544935759] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:23,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:23,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 05:37:23,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188336157] [2021-08-27 05:37:23,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 05:37:23,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:23,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 05:37:23,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:37:23,121 INFO L87 Difference]: Start difference. First operand 293 states and 342 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:23,215 INFO L93 Difference]: Finished difference Result 316 states and 351 transitions. [2021-08-27 05:37:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 05:37:23,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 05:37:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:23,216 INFO L225 Difference]: With dead ends: 316 [2021-08-27 05:37:23,216 INFO L226 Difference]: Without dead ends: 316 [2021-08-27 05:37:23,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 23.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:37:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-08-27 05:37:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 293. [2021-08-27 05:37:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 213 states have (on average 1.5868544600938967) internal successors, (338), 289 states have internal predecessors, (338), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 341 transitions. [2021-08-27 05:37:23,219 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 341 transitions. Word has length 25 [2021-08-27 05:37:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:23,219 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 341 transitions. [2021-08-27 05:37:23,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 341 transitions. [2021-08-27 05:37:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 05:37:23,220 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:23,220 INFO L512 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] [2021-08-27 05:37:23,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:23,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:23,427 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr103REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:23,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:23,427 INFO L82 PathProgramCache]: Analyzing trace with hash -202289384, now seen corresponding path program 1 times [2021-08-27 05:37:23,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:23,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912603822] [2021-08-27 05:37:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:23,428 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:23,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:23,428 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:23,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-27 05:37:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:23,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 05:37:23,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:23,844 INFO L388 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 11 treesize of output 7 [2021-08-27 05:37:23,849 INFO L388 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 11 treesize of output 7 [2021-08-27 05:37:23,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-08-27 05:37:23,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-08-27 05:37:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:23,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:24,038 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:24,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912603822] [2021-08-27 05:37:24,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912603822] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:24,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:24,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-08-27 05:37:24,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024730147] [2021-08-27 05:37:24,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 05:37:24,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:24,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 05:37:24,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:37:24,039 INFO L87 Difference]: Start difference. First operand 293 states and 341 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:24,516 INFO L93 Difference]: Finished difference Result 392 states and 438 transitions. [2021-08-27 05:37:24,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 05:37:24,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 05:37:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:24,518 INFO L225 Difference]: With dead ends: 392 [2021-08-27 05:37:24,518 INFO L226 Difference]: Without dead ends: 392 [2021-08-27 05:37:24,518 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 96.5ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:37:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-08-27 05:37:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 279. [2021-08-27 05:37:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 199 states have (on average 1.5829145728643217) internal successors, (315), 275 states have internal predecessors, (315), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 318 transitions. [2021-08-27 05:37:24,522 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 318 transitions. Word has length 27 [2021-08-27 05:37:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:24,522 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 318 transitions. [2021-08-27 05:37:24,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 318 transitions. [2021-08-27 05:37:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 05:37:24,523 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:24,523 INFO L512 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] [2021-08-27 05:37:24,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-08-27 05:37:24,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:24,733 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:24,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:24,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1667056489, now seen corresponding path program 1 times [2021-08-27 05:37:24,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:24,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324095187] [2021-08-27 05:37:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:24,734 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:24,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:24,735 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:24,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-27 05:37:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:25,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 05:37:25,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:25,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:25,169 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 05:37:25,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2021-08-27 05:37:25,224 INFO L388 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 28 treesize of output 24 [2021-08-27 05:37:25,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:37:25,254 INFO L388 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 38 treesize of output 37 [2021-08-27 05:37:25,350 INFO L354 Elim1Store]: treesize reduction 46, result has 31.3 percent of original size [2021-08-27 05:37:25,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 49 [2021-08-27 05:37:25,423 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-08-27 05:37:25,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2021-08-27 05:37:25,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:37:25,702 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 05:37:25,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2021-08-27 05:37:25,878 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 05:37:25,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 59 [2021-08-27 05:37:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:26,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:27,102 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:27,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324095187] [2021-08-27 05:37:27,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324095187] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:37:27,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:37:27,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2021-08-27 05:37:27,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860896863] [2021-08-27 05:37:27,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 05:37:27,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:37:27,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 05:37:27,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-08-27 05:37:27,104 INFO L87 Difference]: Start difference. First operand 279 states and 318 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:32,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:37:32,043 INFO L93 Difference]: Finished difference Result 320 states and 365 transitions. [2021-08-27 05:37:32,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 05:37:32,043 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 05:37:32,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:37:32,044 INFO L225 Difference]: With dead ends: 320 [2021-08-27 05:37:32,044 INFO L226 Difference]: Without dead ends: 320 [2021-08-27 05:37:32,044 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2016.0ms TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2021-08-27 05:37:32,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-08-27 05:37:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 278. [2021-08-27 05:37:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 199 states have (on average 1.5778894472361809) internal successors, (314), 274 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 317 transitions. [2021-08-27 05:37:32,048 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 317 transitions. Word has length 28 [2021-08-27 05:37:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:37:32,048 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 317 transitions. [2021-08-27 05:37:32,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:37:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 317 transitions. [2021-08-27 05:37:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 05:37:32,048 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:37:32,049 INFO L512 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] [2021-08-27 05:37:32,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-27 05:37:32,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:37:32,261 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr19REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 147 more)] === [2021-08-27 05:37:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:37:32,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1667056490, now seen corresponding path program 1 times [2021-08-27 05:37:32,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:37:32,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317251561] [2021-08-27 05:37:32,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:32,262 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:37:32,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:37:32,262 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:37:32,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-08-27 05:37:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:32,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-27 05:37:32,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:32,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:32,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:32,745 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 05:37:32,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 05:37:32,786 INFO L388 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 17 treesize of output 13 [2021-08-27 05:37:32,795 INFO L388 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 11 treesize of output 7 [2021-08-27 05:37:32,836 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 05:37:32,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-08-27 05:37:32,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:37:32,844 INFO L388 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 21 treesize of output 20 [2021-08-27 05:37:32,943 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-08-27 05:37:32,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2021-08-27 05:37:32,964 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 05:37:32,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-08-27 05:37:33,012 INFO L388 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 21 treesize of output 20 [2021-08-27 05:37:33,024 INFO L388 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 19 treesize of output 18 [2021-08-27 05:37:33,204 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 05:37:33,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 77 [2021-08-27 05:37:33,229 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 05:37:33,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 79 [2021-08-27 05:37:33,444 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-08-27 05:37:33,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 64 [2021-08-27 05:37:33,455 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-08-27 05:37:33,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 32 [2021-08-27 05:37:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:33,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:37:36,044 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|main_~#iter~0.offset| (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_main_~#iter~0.base| (store (select |c_#memory_$Pointer$.offset| |c_main_~#iter~0.base|) |main_~#iter~0.offset| c_main_~list~0.offset)) c_main_~list~0.base) c_main_~list~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_~#iter~0.base| (store (select |c_#memory_$Pointer$.base| |c_main_~#iter~0.base|) |main_~#iter~0.offset| c_main_~list~0.base)) c_main_~list~0.base) c_main_~list~0.offset)))) (forall ((|main_~#iter~0.offset| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_main_~#iter~0.base| (store (select |c_#memory_$Pointer$.offset| |c_main_~#iter~0.base|) |main_~#iter~0.offset| c_main_~list~0.offset)) c_main_~list~0.base) c_main_~list~0.offset))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2021-08-27 05:37:38,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_main_~#iter~0.base_67| (_ BitVec 32))) (or (and (forall ((|main_~#iter~0.offset| (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_67| (store (select |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_67|) |main_~#iter~0.offset| c_main_~data~0.offset)) c_main_~data~0.base) c_main_~data~0.offset)) (select (store |c_#length| |v_main_~#iter~0.base_67| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_main_~#iter~0.base_67| (store (select |c_#memory_$Pointer$.base| |v_main_~#iter~0.base_67|) |main_~#iter~0.offset| c_main_~data~0.base)) c_main_~data~0.base) c_main_~data~0.offset)))) (forall ((|main_~#iter~0.offset| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_67| (store (select |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_67|) |main_~#iter~0.offset| c_main_~data~0.offset)) c_main_~data~0.base) c_main_~data~0.offset))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_main_~#iter~0.base_67|)))))) is different from false [2021-08-27 05:37:40,276 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_main_~#iter~0.base_67| (_ BitVec 32))) (or (and (forall ((|main_~#iter~0.offset| (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_67| (store (select |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_67|) |main_~#iter~0.offset| c_main_~item~0.offset)) c_main_~item~0.base) c_main_~item~0.offset)) (select (store |c_#length| |v_main_~#iter~0.base_67| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_main_~#iter~0.base_67| (store (select |c_#memory_$Pointer$.base| |v_main_~#iter~0.base_67|) |main_~#iter~0.offset| c_main_~item~0.base)) c_main_~item~0.base) c_main_~item~0.offset)))) (forall ((|main_~#iter~0.offset| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_67| (store (select |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_67|) |main_~#iter~0.offset| c_main_~item~0.offset)) c_main_~item~0.base) c_main_~item~0.offset))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_main_~#iter~0.base_67|)))))) is different from false [2021-08-27 05:37:51,133 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:37:51,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317251561] [2021-08-27 05:37:51,133 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 05:37:51,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1039208302] [2021-08-27 05:37:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:37:51,134 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 05:37:51,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 05:37:51,135 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 05:37:51,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2021-08-27 05:37:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:37:51,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-27 05:37:51,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:37:51,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:51,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:37:52,104 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 05:37:52,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2021-08-27 05:37:52,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 05:37:52,313 INFO L388 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 11 treesize of output 7 [2021-08-27 05:37:52,325 INFO L388 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 41 treesize of output 37 [2021-08-27 05:37:52,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:37:52,452 INFO L388 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 61 treesize of output 52 [2021-08-27 05:37:52,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:37:52,470 INFO L388 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 21 treesize of output 20 [2021-08-27 05:37:52,710 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-08-27 05:37:52,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 56 [2021-08-27 05:37:52,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-08-27 05:37:52,933 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-08-27 05:37:52,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2021-08-27 05:37:52,993 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 05:37:52,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-08-27 05:37:53,589 INFO L354 Elim1Store]: treesize reduction 132, result has 14.3 percent of original size [2021-08-27 05:37:53,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 104 [2021-08-27 05:37:53,643 INFO L354 Elim1Store]: treesize reduction 148, result has 12.9 percent of original size [2021-08-27 05:37:53,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 114 [2021-08-27 05:37:54,486 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-08-27 05:37:54,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 86 [2021-08-27 05:37:54,500 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-08-27 05:37:54,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2021-08-27 05:37:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:37:54,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:38:09,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_main_~#iter~0.base_68| (_ BitVec 32))) (or (not (bvult |c_#StackHeapBarrier| |v_main_~#iter~0.base_68|)) (and (forall ((|main_~#iter~0.offset| (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_68| (store (select |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_68|) |main_~#iter~0.offset| c_main_~item~0.offset)) c_main_~item~0.base) c_main_~item~0.offset)) (select (store |c_#length| |v_main_~#iter~0.base_68| (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| |v_main_~#iter~0.base_68| (store (select |c_#memory_$Pointer$.base| |v_main_~#iter~0.base_68|) |main_~#iter~0.offset| c_main_~item~0.base)) c_main_~item~0.base) c_main_~item~0.offset)))) (forall ((|main_~#iter~0.offset| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_68| (store (select |c_#memory_$Pointer$.offset| |v_main_~#iter~0.base_68|) |main_~#iter~0.offset| c_main_~item~0.offset)) c_main_~item~0.base) c_main_~item~0.offset))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (not (= (_ bv0 1) (select |c_#valid| |v_main_~#iter~0.base_68|))))) is different from false [2021-08-27 05:38:23,719 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 05:38:23,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927714395] [2021-08-27 05:38:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:38:23,719 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:38:23,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:38:23,721 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:38:23,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-27 05:38:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:38:24,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-27 05:38:24,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:38:24,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:38:24,507 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 05:38:24,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 05:38:24,540 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 05:38:24,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-08-27 05:38:24,795 INFO L388 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 36 treesize of output 32 [2021-08-27 05:38:24,815 INFO L388 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 11 treesize of output 7 [2021-08-27 05:38:24,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:38:24,988 INFO L388 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 21 treesize of output 20 [2021-08-27 05:38:24,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 05:38:25,000 INFO L388 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 54 treesize of output 45 [2021-08-27 05:38:25,461 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-08-27 05:38:25,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 41 [2021-08-27 05:38:25,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-08-27 05:38:25,693 INFO L388 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 37 treesize of output 28 [2021-08-27 05:38:25,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-08-27 05:38:26,365 INFO L354 Elim1Store]: treesize reduction 132, result has 14.3 percent of original size [2021-08-27 05:38:26,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 91 [2021-08-27 05:38:26,415 INFO L354 Elim1Store]: treesize reduction 140, result has 17.6 percent of original size [2021-08-27 05:38:26,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 117 [2021-08-27 05:38:26,942 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-08-27 05:38:26,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 77 [2021-08-27 05:38:26,965 INFO L354 Elim1Store]: treesize reduction 68, result has 4.2 percent of original size [2021-08-27 05:38:26,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 46 [2021-08-27 05:38:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:38:27,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:39:54,687 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 05:39:54,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:39:54,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 05:39:54,687 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 05:39:54,687 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 05:39:54,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 05:39:54,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 05:39:54,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 05:39:54,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 05:39:54,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 05:39:54,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 05:39:54,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 05:39:54,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 05:39:54,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-08-27 05:39:54,693 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION [2021-08-27 05:39:54,694 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr80REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr81REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr82REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr83REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr84REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr85REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr86REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr87REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr88REQUIRES_VIOLATION [2021-08-27 05:39:54,695 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr89REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr90ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr91ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr92ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr93REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr94REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr95REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr96REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr97REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr98REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr99REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr100REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr101REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr102REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr103REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr104REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr105REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr106REQUIRES_VIOLATION [2021-08-27 05:39:54,696 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr107REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr108REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr109REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr110REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr111REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr112REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr113REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr114REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr115REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr116REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr117REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr118REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr119REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr120REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr121REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr122REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr123REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr124REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr125REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr126REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr127REQUIRES_VIOLATION [2021-08-27 05:39:54,697 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr128REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr129REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr130REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr131REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr132REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr133REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr134REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr135REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr136REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr137REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr138REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr139REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr140REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr141REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr142REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr143REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr144REQUIRES_VIOLATION [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr145ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr146ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:39:54,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr147ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:39:54,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr148ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:39:54,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr149ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:39:54,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr150ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:39:54,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr151ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 05:39:54,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2021-08-27 05:39:54,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-08-27 05:39:55,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-08-27 05:39:55,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:39:55,304 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 05:39:55,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 05:39:55 BoogieIcfgContainer [2021-08-27 05:39:55,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 05:39:55,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 05:39:55,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 05:39:55,312 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 05:39:55,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:37:05" (3/4) ... [2021-08-27 05:39:55,317 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 05:39:55,317 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 05:39:55,317 INFO L168 Benchmark]: Toolchain (without parser) took 171160.58 ms. Allocated memory was 60.8 MB in the beginning and 113.2 MB in the end (delta: 52.4 MB). Free memory was 38.3 MB in the beginning and 30.6 MB in the end (delta: 7.7 MB). Peak memory consumption was 61.0 MB. Max. memory is 16.1 GB. [2021-08-27 05:39:55,318 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 60.8 MB. Free memory was 43.0 MB in the beginning and 42.9 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:39:55,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.20 ms. Allocated memory is still 60.8 MB. Free memory was 38.1 MB in the beginning and 35.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-27 05:39:55,318 INFO L168 Benchmark]: Boogie Preprocessor took 84.38 ms. Allocated memory is still 60.8 MB. Free memory was 35.1 MB in the beginning and 30.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 05:39:55,318 INFO L168 Benchmark]: RCFGBuilder took 1285.69 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 30.8 MB in the beginning and 44.4 MB in the end (delta: -13.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. [2021-08-27 05:39:55,319 INFO L168 Benchmark]: TraceAbstraction took 169395.87 ms. Allocated memory was 77.6 MB in the beginning and 113.2 MB in the end (delta: 35.7 MB). Free memory was 43.9 MB in the beginning and 30.6 MB in the end (delta: 13.3 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.1 GB. [2021-08-27 05:39:55,319 INFO L168 Benchmark]: Witness Printer took 5.54 ms. Allocated memory is still 113.2 MB. Free memory is still 30.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:39:55,319 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 60.8 MB. Free memory was 43.0 MB in the beginning and 42.9 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 384.20 ms. Allocated memory is still 60.8 MB. Free memory was 38.1 MB in the beginning and 35.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 84.38 ms. Allocated memory is still 60.8 MB. Free memory was 35.1 MB in the beginning and 30.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1285.69 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 30.8 MB in the beginning and 44.4 MB in the end (delta: -13.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 169395.87 ms. Allocated memory was 77.6 MB in the beginning and 113.2 MB in the end (delta: 35.7 MB). Free memory was 43.9 MB in the beginning and 30.6 MB in the end (delta: 13.3 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.1 GB. * Witness Printer took 5.54 ms. Allocated memory is still 113.2 MB. Free memory is still 30.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L538] struct list *data = ((void *)0); [L540] COND TRUE __VERIFIER_nondet_int() [L542] struct node *node = malloc(sizeof *node); [L543] COND FALSE !(!node) [L545] node->next = ((void *)0) [L546] node->value = __VERIFIER_nondet_int() [L547] struct list *item = malloc(sizeof *item); [L548] COND FALSE !(!item) [L550] item->slist = node [L551] item->next = data [L552] data = item [L540] COND FALSE !(__VERIFIER_nondet_int()) [L556] struct iterator iter; [L558] struct list *list = data; [L559] EXPR iter.list = list [L559] COND TRUE (iter.list = list) [L560] EXPR list->slist [L560] iter.node = list->slist [L562] struct node *node; [L564] EXPR iter.list [L564] COND FALSE !(!iter.list) [L567] EXPR iter.node [L567] struct node *current = iter.node; [L568] current->next - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 597]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 597]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 617]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 617]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 617]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 617]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 641]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 641]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 645]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 645]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 645]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 645]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 657]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 657]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 660]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 660]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 664]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 664]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 664]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 664]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 664]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 664]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 665]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 665]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 665]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 665]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 665]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 665]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 674]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 674]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 675]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 675]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 677]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 677]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 678]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 678]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 678]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 681]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 681]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 681]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 536]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 338 locations, 152 error locations. Started 1 CEGAR loops. OverallTime: 169344.5ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 28.1ms, AutomataDifference: 13597.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 14.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5524 SDtfs, 5201 SDslu, 8954 SDs, 0 SdLazy, 4831 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10256.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 542 SyntacticMatches, 14 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2780.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=10, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 121.9ms AutomataMinimizationTime, 19 MinimizatonAttempts, 1744 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 132.0ms SsaConstructionTime, 454.5ms SatisfiabilityAnalysisTime, 4816.8ms InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 596 ConstructedInterpolants, 32 QuantifiedInterpolants, 3370 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1756 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 05:39:55,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...