./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.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/forester-heap/sll-simple-white-blue-1.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 9d82c8ca4c880c13a152abb4a8dcf1f5948563b2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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/forester-heap/sll-simple-white-blue-1.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 9d82c8ca4c880c13a152abb4a8dcf1f5948563b2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 06:44:45,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:44:45,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:44:45,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:44:45,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:44:45,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:44:45,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:44:45,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:44:45,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:44:45,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:44:45,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:44:45,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:44:45,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:44:45,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:44:45,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:44:45,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:44:45,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:44:45,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:44:45,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:44:45,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:44:45,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:44:45,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:44:45,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:44:45,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:44:45,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:44:45,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:44:45,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:44:45,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:44:45,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:44:45,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:44:45,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:44:45,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:44:45,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:44:45,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:44:45,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:44:45,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:44:45,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:44:45,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:44:45,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:44:45,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:44:45,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:44:45,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 06:44:45,577 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:44:45,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:44:45,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:44:45,577 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:44:45,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:44:45,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:44:45,578 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:44:45,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:44:45,579 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:44:45,579 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:44:45,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:44:45,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:44:45,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:44:45,579 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:44:45,580 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:44:45,580 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:44:45,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:44:45,580 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:44:45,583 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:44:45,584 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:44:45,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:44:45,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:44:45,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:44:45,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:44:45,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:44:45,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:44:45,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 06:44:45,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 06:44:45,601 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:44:45,601 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 -> 9d82c8ca4c880c13a152abb4a8dcf1f5948563b2 [2021-08-27 06:44:45,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:44:45,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:44:45,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:44:45,894 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:44:45,895 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:44:45,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2021-08-27 06:44:45,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb374b61/88b2b5aaea424184a17d4fa920fd8f4d/FLAG513a562a3 [2021-08-27 06:44:46,387 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:44:46,388 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2021-08-27 06:44:46,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb374b61/88b2b5aaea424184a17d4fa920fd8f4d/FLAG513a562a3 [2021-08-27 06:44:46,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb374b61/88b2b5aaea424184a17d4fa920fd8f4d [2021-08-27 06:44:46,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:44:46,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:44:46,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:44:46,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:44:46,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:44:46,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:44:46" (1/1) ... [2021-08-27 06:44:46,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d98a526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:44:46, skipping insertion in model container [2021-08-27 06:44:46,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:44:46" (1/1) ... [2021-08-27 06:44:46,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:44:46,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:44:46,686 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2021-08-27 06:44:46,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:44:46,705 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:44:46,759 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2021-08-27 06:44:46,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:44:46,789 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:44:46,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:44:46 WrapperNode [2021-08-27 06:44:46,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:44:46,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:44:46,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:44:46,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:44:46,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:44:46" (1/1) ... [2021-08-27 06:44:46,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:44:46" (1/1) ... [2021-08-27 06:44:46,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:44:46" (1/1) ... [2021-08-27 06:44:46,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:44:46" (1/1) ... [2021-08-27 06:44:46,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:44:46" (1/1) ... [2021-08-27 06:44:46,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:44:46" (1/1) ... [2021-08-27 06:44:46,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:44:46" (1/1) ... [2021-08-27 06:44:46,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:44:46,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:44:46,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:44:46,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:44:46,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:44:46" (1/1) ... [2021-08-27 06:44:46,885 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:44:46,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:44:46,926 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 06:44:46,987 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 06:44:47,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:44:47,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:44:47,001 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:44:47,001 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:44:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:44:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:44:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:44:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:44:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:44:47,002 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:44:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:44:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:44:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:44:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:44:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:44:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:44:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:44:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:44:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:44:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:44:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:44:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:44:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:44:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:44:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:44:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:44:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:44:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:44:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:44:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:44:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:44:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:44:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:44:47,005 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:44:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:44:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:44:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:44:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:44:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:44:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:44:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:44:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:44:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:44:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:44:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:44:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:44:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:44:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:44:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:44:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:44:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:44:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:44:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:44:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:44:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:44:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:44:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:44:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:44:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:44:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:44:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:44:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:44:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:44:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:44:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:44:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:44:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:44:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:44:47,012 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:44:47,012 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:44:47,012 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:44:47,012 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:44:47,012 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:44:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:44:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:44:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:44:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:44:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:44:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:44:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:44:47,015 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:44:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:44:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:44:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:44:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:44:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:44:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:44:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:44:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:44:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:44:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:44:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:44:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:44:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:44:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:44:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:44:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:44:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:44:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:44:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:44:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:44:47,019 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:44:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:44:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:44:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:44:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:44:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:44:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:44:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:44:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:44:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:44:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:44:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:44:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:44:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:44:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:44:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 06:44:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:44:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 06:44:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:44:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:44:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 06:44:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:44:47,464 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:44:47,465 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-27 06:44:47,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:44:47 BoogieIcfgContainer [2021-08-27 06:44:47,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:44:47,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:44:47,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:44:47,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:44:47,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:44:46" (1/3) ... [2021-08-27 06:44:47,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d617d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:44:47, skipping insertion in model container [2021-08-27 06:44:47,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:44:46" (2/3) ... [2021-08-27 06:44:47,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d617d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:44:47, skipping insertion in model container [2021-08-27 06:44:47,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:44:47" (3/3) ... [2021-08-27 06:44:47,471 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2021-08-27 06:44:47,477 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:44:47,477 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2021-08-27 06:44:47,501 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:44:47,505 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 06:44:47,506 INFO L340 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2021-08-27 06:44:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 99 states have internal predecessors, (115), 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 06:44:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:44:47,519 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:47,519 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:44:47,519 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:47,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:47,523 INFO L82 PathProgramCache]: Analyzing trace with hash -328980574, now seen corresponding path program 1 times [2021-08-27 06:44:47,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:47,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888078209] [2021-08-27 06:44:47,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:47,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:47,717 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 06:44:47,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:47,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888078209] [2021-08-27 06:44:47,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888078209] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:47,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:47,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:44:47,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802427135] [2021-08-27 06:44:47,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:44:47,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:47,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:44:47,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:44:47,737 INFO L87 Difference]: Start difference. First operand has 104 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 99 states have internal predecessors, (115), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 06:44:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:47,972 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2021-08-27 06:44:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:44:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 7 [2021-08-27 06:44:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:47,980 INFO L225 Difference]: With dead ends: 131 [2021-08-27 06:44:47,980 INFO L226 Difference]: Without dead ends: 127 [2021-08-27 06:44:47,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:44:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-08-27 06:44:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 98. [2021-08-27 06:44:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 94 states have internal predecessors, (101), 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 06:44:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2021-08-27 06:44:48,004 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 7 [2021-08-27 06:44:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:48,005 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2021-08-27 06:44:48,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 06:44:48,005 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2021-08-27 06:44:48,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:44:48,005 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:48,006 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:44:48,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 06:44:48,006 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:48,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:48,006 INFO L82 PathProgramCache]: Analyzing trace with hash -328980573, now seen corresponding path program 1 times [2021-08-27 06:44:48,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:48,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271469352] [2021-08-27 06:44:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:48,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:48,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:48,055 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 06:44:48,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:48,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271469352] [2021-08-27 06:44:48,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271469352] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:48,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:48,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:44:48,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399681130] [2021-08-27 06:44:48,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:44:48,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:48,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:44:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:44:48,058 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 06:44:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:48,220 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-08-27 06:44:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:44:48,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 7 [2021-08-27 06:44:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:48,222 INFO L225 Difference]: With dead ends: 125 [2021-08-27 06:44:48,222 INFO L226 Difference]: Without dead ends: 125 [2021-08-27 06:44:48,222 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:44:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-27 06:44:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 96. [2021-08-27 06:44:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 92 states have internal predecessors, (99), 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 06:44:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2021-08-27 06:44:48,228 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 7 [2021-08-27 06:44:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:48,228 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2021-08-27 06:44:48,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 06:44:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2021-08-27 06:44:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 06:44:48,229 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:48,229 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:44:48,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 06:44:48,229 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash -761839981, now seen corresponding path program 1 times [2021-08-27 06:44:48,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:48,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589494385] [2021-08-27 06:44:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:48,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:48,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:48,299 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 06:44:48,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:48,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589494385] [2021-08-27 06:44:48,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589494385] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:48,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:48,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:44:48,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139506113] [2021-08-27 06:44:48,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:44:48,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:48,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:44:48,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:44:48,301 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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 06:44:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:48,470 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2021-08-27 06:44:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:44:48,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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 06:44:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:48,474 INFO L225 Difference]: With dead ends: 99 [2021-08-27 06:44:48,474 INFO L226 Difference]: Without dead ends: 99 [2021-08-27 06:44:48,475 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:44:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-08-27 06:44:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2021-08-27 06:44:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 87 states have internal predecessors, (100), 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 06:44:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2021-08-27 06:44:48,490 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 12 [2021-08-27 06:44:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:48,491 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2021-08-27 06:44:48,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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 06:44:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2021-08-27 06:44:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 06:44:48,491 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:48,492 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:44:48,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 06:44:48,492 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:48,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:48,493 INFO L82 PathProgramCache]: Analyzing trace with hash -761839980, now seen corresponding path program 1 times [2021-08-27 06:44:48,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:48,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155660268] [2021-08-27 06:44:48,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:48,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:48,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:48,642 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 06:44:48,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:48,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155660268] [2021-08-27 06:44:48,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155660268] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:48,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:48,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:44:48,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882816655] [2021-08-27 06:44:48,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:44:48,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:48,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:44:48,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:44:48,647 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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 06:44:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:48,861 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-08-27 06:44:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:44:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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 06:44:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:48,862 INFO L225 Difference]: With dead ends: 121 [2021-08-27 06:44:48,862 INFO L226 Difference]: Without dead ends: 121 [2021-08-27 06:44:48,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 58.0ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:44:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-08-27 06:44:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2021-08-27 06:44:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 102 states have internal predecessors, (115), 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 06:44:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2021-08-27 06:44:48,866 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 12 [2021-08-27 06:44:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:48,866 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2021-08-27 06:44:48,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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 06:44:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2021-08-27 06:44:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:44:48,866 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:48,867 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:44:48,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 06:44:48,867 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:48,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:48,867 INFO L82 PathProgramCache]: Analyzing trace with hash 551534933, now seen corresponding path program 1 times [2021-08-27 06:44:48,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:48,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005768017] [2021-08-27 06:44:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:48,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:48,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:48,928 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 06:44:48,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:48,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005768017] [2021-08-27 06:44:48,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005768017] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:48,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:48,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:44:48,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402119819] [2021-08-27 06:44:48,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:44:48,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:48,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:44:48,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:44:48,930 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 06:44:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:49,114 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2021-08-27 06:44:49,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:44:49,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 16 [2021-08-27 06:44:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:49,115 INFO L225 Difference]: With dead ends: 107 [2021-08-27 06:44:49,115 INFO L226 Difference]: Without dead ends: 107 [2021-08-27 06:44:49,116 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 48.2ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:44:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-08-27 06:44:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2021-08-27 06:44:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 101 states have internal predecessors, (114), 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 06:44:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2021-08-27 06:44:49,119 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 16 [2021-08-27 06:44:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:49,119 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2021-08-27 06:44:49,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 06:44:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2021-08-27 06:44:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:44:49,119 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:49,120 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:44:49,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 06:44:49,120 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:49,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:49,120 INFO L82 PathProgramCache]: Analyzing trace with hash 551534934, now seen corresponding path program 1 times [2021-08-27 06:44:49,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:49,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32684335] [2021-08-27 06:44:49,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:49,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:49,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:49,187 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 06:44:49,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:49,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32684335] [2021-08-27 06:44:49,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32684335] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:49,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:49,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:44:49,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975669199] [2021-08-27 06:44:49,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:44:49,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:49,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:44:49,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:44:49,189 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 06:44:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:49,410 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2021-08-27 06:44:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:44:49,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 16 [2021-08-27 06:44:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:49,412 INFO L225 Difference]: With dead ends: 105 [2021-08-27 06:44:49,412 INFO L226 Difference]: Without dead ends: 105 [2021-08-27 06:44:49,412 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 84.0ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:44:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-08-27 06:44:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2021-08-27 06:44:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 92 states have internal predecessors, (104), 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 06:44:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2021-08-27 06:44:49,415 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 16 [2021-08-27 06:44:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:49,415 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2021-08-27 06:44:49,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 06:44:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2021-08-27 06:44:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:44:49,416 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:49,416 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 06:44:49,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 06:44:49,416 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:49,417 INFO L82 PathProgramCache]: Analyzing trace with hash -393029940, now seen corresponding path program 1 times [2021-08-27 06:44:49,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:49,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491107305] [2021-08-27 06:44:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:49,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:49,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:49,476 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 06:44:49,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:49,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491107305] [2021-08-27 06:44:49,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491107305] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:49,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:49,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:44:49,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790199244] [2021-08-27 06:44:49,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:44:49,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:49,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:44:49,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:44:49,478 INFO L87 Difference]: Start difference. First operand 96 states and 107 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 06:44:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:49,611 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2021-08-27 06:44:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:44:49,611 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 06:44:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:49,612 INFO L225 Difference]: With dead ends: 107 [2021-08-27 06:44:49,612 INFO L226 Difference]: Without dead ends: 107 [2021-08-27 06:44:49,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.0ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:44:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-08-27 06:44:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2021-08-27 06:44:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 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 06:44:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2021-08-27 06:44:49,615 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 19 [2021-08-27 06:44:49,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:49,616 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2021-08-27 06:44:49,616 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 06:44:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2021-08-27 06:44:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:44:49,616 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:49,617 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 06:44:49,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 06:44:49,617 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:49,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:49,617 INFO L82 PathProgramCache]: Analyzing trace with hash 229411301, now seen corresponding path program 1 times [2021-08-27 06:44:49,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:49,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359540102] [2021-08-27 06:44:49,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:49,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:49,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:44:49,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:49,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359540102] [2021-08-27 06:44:49,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359540102] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:44:49,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423170910] [2021-08-27 06:44:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:49,709 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:44:49,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:44:49,710 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 06:44:49,738 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 06:44:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:49,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 06:44:49,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:44:49,903 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 06:44:49,950 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:44:49,951 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 06:44:50,008 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 21 treesize of output 17 [2021-08-27 06:44:50,117 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 30 treesize of output 18 [2021-08-27 06:44:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:44:50,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423170910] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:44:50,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:44:50,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-08-27 06:44:50,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155596774] [2021-08-27 06:44:50,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:44:50,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:50,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:44:50,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:44:50,172 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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 06:44:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:50,609 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2021-08-27 06:44:50,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 06:44:50,609 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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 22 [2021-08-27 06:44:50,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:50,610 INFO L225 Difference]: With dead ends: 150 [2021-08-27 06:44:50,611 INFO L226 Difference]: Without dead ends: 150 [2021-08-27 06:44:50,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 223.6ms TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-08-27 06:44:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-08-27 06:44:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 105. [2021-08-27 06:44:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 101 states have internal predecessors, (116), 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 06:44:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2021-08-27 06:44:50,619 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 22 [2021-08-27 06:44:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:50,619 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2021-08-27 06:44:50,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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 06:44:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2021-08-27 06:44:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:44:50,623 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:50,623 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 06:44:50,648 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 06:44:50,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:44:50,841 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr29REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:50,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:50,841 INFO L82 PathProgramCache]: Analyzing trace with hash 229411302, now seen corresponding path program 1 times [2021-08-27 06:44:50,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:50,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615247836] [2021-08-27 06:44:50,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:50,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:44:51,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:51,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615247836] [2021-08-27 06:44:51,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615247836] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:44:51,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332001184] [2021-08-27 06:44:51,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:51,001 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:44:51,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:44:51,002 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 06:44:51,003 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 06:44:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:51,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 06:44:51,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:44:51,148 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 06:44:51,260 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:44:51,261 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 06:44:51,268 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 14 treesize of output 16 [2021-08-27 06:44:51,330 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 37 treesize of output 33 [2021-08-27 06:44:51,334 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 34 treesize of output 30 [2021-08-27 06:44:51,473 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 50 treesize of output 38 [2021-08-27 06:44:51,476 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 35 treesize of output 23 [2021-08-27 06:44:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:44:51,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332001184] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:44:51,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:44:51,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2021-08-27 06:44:51,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700956079] [2021-08-27 06:44:51,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 06:44:51,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:51,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 06:44:51,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:44:51,540 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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 06:44:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:52,508 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2021-08-27 06:44:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:44:52,509 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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 22 [2021-08-27 06:44:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:52,511 INFO L225 Difference]: With dead ends: 171 [2021-08-27 06:44:52,511 INFO L226 Difference]: Without dead ends: 171 [2021-08-27 06:44:52,511 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 586.8ms TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2021-08-27 06:44:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-27 06:44:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 104. [2021-08-27 06:44:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 100 states have internal predecessors, (114), 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 06:44:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2021-08-27 06:44:52,514 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 22 [2021-08-27 06:44:52,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:52,514 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2021-08-27 06:44:52,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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 06:44:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2021-08-27 06:44:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:44:52,515 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:52,515 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 06:44:52,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-08-27 06:44:52,733 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,SelfDestructingSolverStorable8 [2021-08-27 06:44:52,733 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:52,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:52,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1479815103, now seen corresponding path program 1 times [2021-08-27 06:44:52,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:52,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131750240] [2021-08-27 06:44:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:52,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:52,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:52,846 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 06:44:52,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:52,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131750240] [2021-08-27 06:44:52,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131750240] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:52,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:52,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:44:52,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110989411] [2021-08-27 06:44:52,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:44:52,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:52,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:44:52,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:44:52,849 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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 06:44:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:53,146 INFO L93 Difference]: Finished difference Result 148 states and 164 transitions. [2021-08-27 06:44:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:44:53,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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 06:44:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:53,147 INFO L225 Difference]: With dead ends: 148 [2021-08-27 06:44:53,147 INFO L226 Difference]: Without dead ends: 148 [2021-08-27 06:44:53,148 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 93.5ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:44:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-08-27 06:44:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 108. [2021-08-27 06:44:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.411764705882353) internal successors, (120), 104 states have internal predecessors, (120), 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 06:44:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2021-08-27 06:44:53,151 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 23 [2021-08-27 06:44:53,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:53,151 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2021-08-27 06:44:53,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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 06:44:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2021-08-27 06:44:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:44:53,152 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:53,153 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 06:44:53,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 06:44:53,153 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:53,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:53,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1479815102, now seen corresponding path program 1 times [2021-08-27 06:44:53,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:53,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671036686] [2021-08-27 06:44:53,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:53,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:53,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:53,303 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 06:44:53,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:53,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671036686] [2021-08-27 06:44:53,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671036686] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:53,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:53,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:44:53,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010397567] [2021-08-27 06:44:53,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:44:53,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:53,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:44:53,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:44:53,306 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 06:44:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:53,783 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2021-08-27 06:44:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 06:44:53,783 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 06:44:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:53,784 INFO L225 Difference]: With dead ends: 171 [2021-08-27 06:44:53,784 INFO L226 Difference]: Without dead ends: 171 [2021-08-27 06:44:53,785 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 195.9ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:44:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-27 06:44:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 110. [2021-08-27 06:44:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 106 states have internal predecessors, (122), 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 06:44:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2021-08-27 06:44:53,787 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 23 [2021-08-27 06:44:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:53,788 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2021-08-27 06:44:53,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 06:44:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2021-08-27 06:44:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:44:53,789 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:53,789 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 06:44:53,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 06:44:53,789 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr36ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:53,789 INFO L82 PathProgramCache]: Analyzing trace with hash -468135674, now seen corresponding path program 1 times [2021-08-27 06:44:53,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:53,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868518650] [2021-08-27 06:44:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:53,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:53,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:53,937 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 06:44:53,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:53,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868518650] [2021-08-27 06:44:53,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868518650] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:53,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:53,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 06:44:53,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096684864] [2021-08-27 06:44:53,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:44:53,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:53,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:44:53,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:44:53,939 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 06:44:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:54,431 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2021-08-27 06:44:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:44:54,432 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 25 [2021-08-27 06:44:54,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:54,433 INFO L225 Difference]: With dead ends: 208 [2021-08-27 06:44:54,433 INFO L226 Difference]: Without dead ends: 208 [2021-08-27 06:44:54,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 185.8ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-08-27 06:44:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-08-27 06:44:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 121. [2021-08-27 06:44:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 117 states have internal predecessors, (135), 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 06:44:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2021-08-27 06:44:54,435 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 25 [2021-08-27 06:44:54,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:54,436 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2021-08-27 06:44:54,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 06:44:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2021-08-27 06:44:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 06:44:54,436 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:54,437 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] [2021-08-27 06:44:54,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 06:44:54,437 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr44ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1628132728, now seen corresponding path program 1 times [2021-08-27 06:44:54,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:54,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185313199] [2021-08-27 06:44:54,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:54,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:54,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:54,476 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 06:44:54,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:54,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185313199] [2021-08-27 06:44:54,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185313199] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:54,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:54,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:44:54,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325472252] [2021-08-27 06:44:54,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:44:54,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:54,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:44:54,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:44:54,478 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 06:44:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:54,600 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2021-08-27 06:44:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:44:54,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 26 [2021-08-27 06:44:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:54,601 INFO L225 Difference]: With dead ends: 140 [2021-08-27 06:44:54,602 INFO L226 Difference]: Without dead ends: 140 [2021-08-27 06:44:54,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:44:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-08-27 06:44:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 121. [2021-08-27 06:44:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 117 states have internal predecessors, (134), 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 06:44:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2021-08-27 06:44:54,604 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 26 [2021-08-27 06:44:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:54,604 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2021-08-27 06:44:54,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 06:44:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2021-08-27 06:44:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 06:44:54,605 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:54,606 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:44:54,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 06:44:54,606 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:54,606 INFO L82 PathProgramCache]: Analyzing trace with hash -285231333, now seen corresponding path program 2 times [2021-08-27 06:44:54,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:54,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733964552] [2021-08-27 06:44:54,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:54,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 06:44:54,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:54,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733964552] [2021-08-27 06:44:54,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733964552] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:54,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:54,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:44:54,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537483457] [2021-08-27 06:44:54,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:44:54,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:54,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:44:54,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:44:54,704 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 06:44:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:54,938 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2021-08-27 06:44:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:44:54,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 26 [2021-08-27 06:44:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:54,939 INFO L225 Difference]: With dead ends: 149 [2021-08-27 06:44:54,939 INFO L226 Difference]: Without dead ends: 149 [2021-08-27 06:44:54,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 66.0ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:44:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-08-27 06:44:54,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 119. [2021-08-27 06:44:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 115 states have internal predecessors, (130), 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 06:44:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2021-08-27 06:44:54,942 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 26 [2021-08-27 06:44:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:54,942 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2021-08-27 06:44:54,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 06:44:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2021-08-27 06:44:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:44:54,943 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:54,943 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 06:44:54,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 06:44:54,944 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:54,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1043552509, now seen corresponding path program 1 times [2021-08-27 06:44:54,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:54,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280721267] [2021-08-27 06:44:54,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:54,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:55,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:55,039 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 06:44:55,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:55,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280721267] [2021-08-27 06:44:55,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280721267] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:55,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:55,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:44:55,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326110265] [2021-08-27 06:44:55,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:44:55,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:55,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:44:55,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:44:55,041 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 06:44:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:55,286 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2021-08-27 06:44:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:44:55,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 27 [2021-08-27 06:44:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:55,288 INFO L225 Difference]: With dead ends: 168 [2021-08-27 06:44:55,288 INFO L226 Difference]: Without dead ends: 168 [2021-08-27 06:44:55,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 57.6ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:44:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-08-27 06:44:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 122. [2021-08-27 06:44:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 118 states have internal predecessors, (133), 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 06:44:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2021-08-27 06:44:55,290 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 27 [2021-08-27 06:44:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:55,293 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2021-08-27 06:44:55,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 06:44:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2021-08-27 06:44:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:44:55,293 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:55,293 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] [2021-08-27 06:44:55,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 06:44:55,294 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:55,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:55,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1159983514, now seen corresponding path program 1 times [2021-08-27 06:44:55,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:55,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254278318] [2021-08-27 06:44:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:55,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:44:55,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:55,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254278318] [2021-08-27 06:44:55,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254278318] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:44:55,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251322459] [2021-08-27 06:44:55,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:55,441 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:44:55,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:44:55,457 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 06:44:55,505 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 06:44:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:55,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-27 06:44:55,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:44:55,680 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 06:44:55,763 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:44:55,763 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 06:44:55,807 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 21 treesize of output 17 [2021-08-27 06:44:55,945 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-08-27 06:44:55,946 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 44 treesize of output 20 [2021-08-27 06:44:55,974 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:44:55,975 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2021-08-27 06:44:56,154 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:44:56,155 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 24 [2021-08-27 06:44:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:44:56,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251322459] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:44:56,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:44:56,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2021-08-27 06:44:56,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942958343] [2021-08-27 06:44:56,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-27 06:44:56,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:56,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 06:44:56,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-08-27 06:44:56,214 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 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 06:44:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:57,194 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2021-08-27 06:44:57,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-27 06:44:57,195 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 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 27 [2021-08-27 06:44:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:57,195 INFO L225 Difference]: With dead ends: 185 [2021-08-27 06:44:57,195 INFO L226 Difference]: Without dead ends: 185 [2021-08-27 06:44:57,196 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 615.6ms TimeCoverageRelationStatistics Valid=304, Invalid=1178, Unknown=0, NotChecked=0, Total=1482 [2021-08-27 06:44:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-27 06:44:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 138. [2021-08-27 06:44:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 134 states have internal predecessors, (154), 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 06:44:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2021-08-27 06:44:57,199 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 27 [2021-08-27 06:44:57,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:57,199 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2021-08-27 06:44:57,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 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 06:44:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2021-08-27 06:44:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:44:57,200 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:57,200 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] [2021-08-27 06:44:57,218 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 06:44:57,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:44:57,414 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:57,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:57,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1159983515, now seen corresponding path program 1 times [2021-08-27 06:44:57,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:57,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818234468] [2021-08-27 06:44:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:57,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:57,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:44:57,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:57,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818234468] [2021-08-27 06:44:57,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818234468] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:44:57,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183510044] [2021-08-27 06:44:57,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:57,599 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:44:57,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:44:57,600 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 06:44:57,601 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 06:44:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:57,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 39 conjunts are in the unsatisfiable core [2021-08-27 06:44:57,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:44:57,818 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 06:44:57,892 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:44:57,892 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 06:44:57,901 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:44:57,935 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 21 treesize of output 17 [2021-08-27 06:44:57,942 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 06:44:58,075 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-08-27 06:44:58,075 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 27 treesize of output 21 [2021-08-27 06:44:58,093 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-08-27 06:44:58,093 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 44 treesize of output 20 [2021-08-27 06:44:58,136 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:44:58,136 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 45 [2021-08-27 06:44:58,147 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:44:58,147 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 55 treesize of output 50 [2021-08-27 06:44:58,402 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:44:58,403 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2021-08-27 06:44:58,409 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:44:58,409 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 31 treesize of output 19 [2021-08-27 06:44:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:44:58,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183510044] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:44:58,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:44:58,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2021-08-27 06:44:58,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600315581] [2021-08-27 06:44:58,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 06:44:58,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:58,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 06:44:58,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-08-27 06:44:58,426 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 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 06:44:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:44:59,360 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2021-08-27 06:44:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 06:44:59,361 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 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 27 [2021-08-27 06:44:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:44:59,361 INFO L225 Difference]: With dead ends: 194 [2021-08-27 06:44:59,361 INFO L226 Difference]: Without dead ends: 194 [2021-08-27 06:44:59,362 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 610.8ms TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2021-08-27 06:44:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-08-27 06:44:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2021-08-27 06:44:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.3252032520325203) internal successors, (163), 142 states have internal predecessors, (163), 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 06:44:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2021-08-27 06:44:59,365 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 27 [2021-08-27 06:44:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:44:59,365 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2021-08-27 06:44:59,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 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 06:44:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2021-08-27 06:44:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:44:59,365 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:44:59,365 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 06:44:59,383 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 06:44:59,566 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,SelfDestructingSolverStorable16 [2021-08-27 06:44:59,566 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:44:59,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:44:59,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2011241431, now seen corresponding path program 1 times [2021-08-27 06:44:59,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:44:59,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797144713] [2021-08-27 06:44:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:44:59,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:44:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:59,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:44:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:44:59,739 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 06:44:59,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:44:59,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797144713] [2021-08-27 06:44:59,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797144713] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:44:59,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:44:59,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 06:44:59,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099582951] [2021-08-27 06:44:59,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:44:59,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:44:59,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:44:59,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:44:59,769 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 06:45:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:00,095 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2021-08-27 06:45:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:45:00,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 06:45:00,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:00,100 INFO L225 Difference]: With dead ends: 174 [2021-08-27 06:45:00,101 INFO L226 Difference]: Without dead ends: 174 [2021-08-27 06:45:00,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 127.2ms TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:45:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-27 06:45:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2021-08-27 06:45:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 135 states have (on average 1.2962962962962963) internal successors, (175), 154 states have internal predecessors, (175), 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 06:45:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2021-08-27 06:45:00,127 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 28 [2021-08-27 06:45:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:00,127 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2021-08-27 06:45:00,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 06:45:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2021-08-27 06:45:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:45:00,128 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:00,129 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 06:45:00,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 06:45:00,129 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:00,129 INFO L82 PathProgramCache]: Analyzing trace with hash -452904322, now seen corresponding path program 1 times [2021-08-27 06:45:00,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:00,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702248898] [2021-08-27 06:45:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:00,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:00,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:00,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:00,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702248898] [2021-08-27 06:45:00,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702248898] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:00,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700753531] [2021-08-27 06:45:00,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:00,342 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:00,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:45:00,357 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 06:45:00,374 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 06:45:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:00,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 40 conjunts are in the unsatisfiable core [2021-08-27 06:45:00,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:00,650 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 06:45:00,674 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 06:45:00,680 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 06:45:00,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:45:00,719 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 27 treesize of output 11 [2021-08-27 06:45:00,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:45:00,724 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 27 treesize of output 11 [2021-08-27 06:45:00,790 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:45:00,791 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 06:45:00,833 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 27 treesize of output 11 [2021-08-27 06:45:00,841 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 27 treesize of output 11 [2021-08-27 06:45:00,865 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 06:45:00,866 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 41 treesize of output 40 [2021-08-27 06:45:00,878 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-08-27 06:45:00,878 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 06:45:01,172 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 06:45:01,172 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 68 treesize of output 42 [2021-08-27 06:45:01,181 INFO L354 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2021-08-27 06:45:01,182 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 33 treesize of output 23 [2021-08-27 06:45:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:01,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700753531] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:01,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:45:01,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-08-27 06:45:01,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242364534] [2021-08-27 06:45:01,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 06:45:01,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:01,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 06:45:01,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-08-27 06:45:01,199 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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 06:45:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:01,876 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions. [2021-08-27 06:45:01,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 06:45:01,876 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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 28 [2021-08-27 06:45:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:01,877 INFO L225 Difference]: With dead ends: 189 [2021-08-27 06:45:01,877 INFO L226 Difference]: Without dead ends: 189 [2021-08-27 06:45:01,878 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 431.4ms TimeCoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2021-08-27 06:45:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-08-27 06:45:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 160. [2021-08-27 06:45:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 137 states have (on average 1.2919708029197081) internal successors, (177), 156 states have internal predecessors, (177), 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 06:45:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2021-08-27 06:45:01,883 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 28 [2021-08-27 06:45:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:01,883 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2021-08-27 06:45:01,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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 06:45:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2021-08-27 06:45:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:45:01,884 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:01,884 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 06:45:01,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 06:45:02,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:02,102 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr42ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:02,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:02,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1266001972, now seen corresponding path program 1 times [2021-08-27 06:45:02,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:02,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969354492] [2021-08-27 06:45:02,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:02,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:02,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:02,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 06:45:02,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:02,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969354492] [2021-08-27 06:45:02,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969354492] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:45:02,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:45:02,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:45:02,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390321728] [2021-08-27 06:45:02,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:45:02,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:02,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:45:02,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:45:02,172 INFO L87 Difference]: Start difference. First operand 160 states and 180 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 06:45:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:02,414 INFO L93 Difference]: Finished difference Result 197 states and 215 transitions. [2021-08-27 06:45:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:45:02,415 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 06:45:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:02,415 INFO L225 Difference]: With dead ends: 197 [2021-08-27 06:45:02,415 INFO L226 Difference]: Without dead ends: 197 [2021-08-27 06:45:02,416 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 68.2ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:45:02,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-27 06:45:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 160. [2021-08-27 06:45:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 137 states have (on average 1.2773722627737227) internal successors, (175), 156 states have internal predecessors, (175), 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 06:45:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 178 transitions. [2021-08-27 06:45:02,419 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 178 transitions. Word has length 28 [2021-08-27 06:45:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:02,419 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 178 transitions. [2021-08-27 06:45:02,419 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 06:45:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 178 transitions. [2021-08-27 06:45:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 06:45:02,420 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:02,420 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:45:02,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 06:45:02,420 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1046433091, now seen corresponding path program 2 times [2021-08-27 06:45:02,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:02,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204102883] [2021-08-27 06:45:02,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:02,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:02,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:02,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204102883] [2021-08-27 06:45:02,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204102883] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:02,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666949642] [2021-08-27 06:45:02,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 06:45:02,630 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:02,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:45:02,643 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 06:45:02,662 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 06:45:02,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 06:45:02,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 06:45:02,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 44 conjunts are in the unsatisfiable core [2021-08-27 06:45:02,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:02,976 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 06:45:03,053 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:45:03,054 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 06:45:03,095 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 16 treesize of output 12 [2021-08-27 06:45:03,100 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 06:45:03,212 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-08-27 06:45:03,213 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 35 treesize of output 15 [2021-08-27 06:45:03,218 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 27 treesize of output 11 [2021-08-27 06:45:03,253 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:45:03,253 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-08-27 06:45:03,261 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:45:03,262 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2021-08-27 06:45:03,509 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-08-27 06:45:03,509 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2021-08-27 06:45:03,513 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:45:03,514 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2021-08-27 06:45:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:03,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666949642] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:03,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:45:03,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2021-08-27 06:45:03,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86367625] [2021-08-27 06:45:03,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 06:45:03,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:03,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 06:45:03,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2021-08-27 06:45:03,529 INFO L87 Difference]: Start difference. First operand 160 states and 178 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 06:45:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:05,735 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2021-08-27 06:45:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 06:45:05,735 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 32 [2021-08-27 06:45:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:05,736 INFO L225 Difference]: With dead ends: 192 [2021-08-27 06:45:05,736 INFO L226 Difference]: Without dead ends: 192 [2021-08-27 06:45:05,736 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 589.7ms TimeCoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2021-08-27 06:45:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-27 06:45:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 159. [2021-08-27 06:45:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.2647058823529411) internal successors, (172), 155 states have internal predecessors, (172), 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 06:45:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2021-08-27 06:45:05,739 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 32 [2021-08-27 06:45:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:05,739 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 175 transitions. [2021-08-27 06:45:05,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 06:45:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions. [2021-08-27 06:45:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 06:45:05,740 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:05,740 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, 1, 1] [2021-08-27 06:45:05,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 06:45:05,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:05,949 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr42ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash 135230692, now seen corresponding path program 1 times [2021-08-27 06:45:05,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:05,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871603130] [2021-08-27 06:45:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:05,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:05,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:05,991 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 06:45:05,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:05,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871603130] [2021-08-27 06:45:05,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871603130] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:45:05,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:45:05,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:45:05,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976281082] [2021-08-27 06:45:05,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:45:05,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:05,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:45:05,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:45:05,993 INFO L87 Difference]: Start difference. First operand 159 states and 175 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 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 06:45:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:06,129 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2021-08-27 06:45:06,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:45:06,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 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 06:45:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:06,130 INFO L225 Difference]: With dead ends: 163 [2021-08-27 06:45:06,130 INFO L226 Difference]: Without dead ends: 163 [2021-08-27 06:45:06,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:45:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-27 06:45:06,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2021-08-27 06:45:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 156 states have internal predecessors, (173), 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 06:45:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2021-08-27 06:45:06,133 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 33 [2021-08-27 06:45:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:06,133 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2021-08-27 06:45:06,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 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 06:45:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2021-08-27 06:45:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 06:45:06,134 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:06,134 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 06:45:06,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 06:45:06,134 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr36ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:06,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:06,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1020126892, now seen corresponding path program 1 times [2021-08-27 06:45:06,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:06,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133117593] [2021-08-27 06:45:06,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:06,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:06,455 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 06:45:06,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:06,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133117593] [2021-08-27 06:45:06,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133117593] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:06,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659733027] [2021-08-27 06:45:06,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:06,456 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:06,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:45:06,457 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 06:45:06,458 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 06:45:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:06,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjunts are in the unsatisfiable core [2021-08-27 06:45:06,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:06,790 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 06:45:06,805 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 06:45:06,874 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:45:06,874 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 06:45:06,909 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 16 treesize of output 12 [2021-08-27 06:45:06,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:45:06,917 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 25 treesize of output 13 [2021-08-27 06:45:06,976 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 19 treesize of output 11 [2021-08-27 06:45:07,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:45:07,016 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 06:45:07,068 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 06:45:07,068 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 38 treesize of output 29 [2021-08-27 06:45:07,183 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:45:07,183 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 06:45:07,252 INFO L354 Elim1Store]: treesize reduction 43, result has 28.3 percent of original size [2021-08-27 06:45:07,252 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 36 treesize of output 46 [2021-08-27 06:45:07,307 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 06:45:07,311 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 43 treesize of output 39 [2021-08-27 06:45:07,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:45:07,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:45:07,316 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:45:07,317 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 36 treesize of output 27 [2021-08-27 06:45:07,446 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 40 treesize of output 32 [2021-08-27 06:45:07,448 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 06:45:07,530 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:45:07,530 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 22 treesize of output 14 [2021-08-27 06:45:07,536 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 06:45:07,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659733027] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:07,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:45:07,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 28 [2021-08-27 06:45:07,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991360443] [2021-08-27 06:45:07,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-27 06:45:07,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:07,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-27 06:45:07,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2021-08-27 06:45:07,538 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 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 06:45:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:08,761 INFO L93 Difference]: Finished difference Result 239 states and 257 transitions. [2021-08-27 06:45:08,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 06:45:08,762 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 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 33 [2021-08-27 06:45:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:08,762 INFO L225 Difference]: With dead ends: 239 [2021-08-27 06:45:08,763 INFO L226 Difference]: Without dead ends: 239 [2021-08-27 06:45:08,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 846.9ms TimeCoverageRelationStatistics Valid=298, Invalid=2054, Unknown=0, NotChecked=0, Total=2352 [2021-08-27 06:45:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-08-27 06:45:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 171. [2021-08-27 06:45:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 148 states have (on average 1.2432432432432432) internal successors, (184), 167 states have internal predecessors, (184), 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 06:45:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2021-08-27 06:45:08,766 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 33 [2021-08-27 06:45:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:08,766 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2021-08-27 06:45:08,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 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 06:45:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2021-08-27 06:45:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 06:45:08,767 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:08,767 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-08-27 06:45:08,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-08-27 06:45:08,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:08,985 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:08,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:08,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1022599576, now seen corresponding path program 3 times [2021-08-27 06:45:08,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:08,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054999809] [2021-08-27 06:45:08,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:08,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:09,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:09,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:09,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054999809] [2021-08-27 06:45:09,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054999809] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:09,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595184948] [2021-08-27 06:45:09,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 06:45:09,286 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:09,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:45:09,287 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 06:45:09,288 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 06:45:09,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-27 06:45:09,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 06:45:09,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 40 conjunts are in the unsatisfiable core [2021-08-27 06:45:09,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:09,690 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 06:45:09,772 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:45:09,772 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 06:45:09,804 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 16 treesize of output 12 [2021-08-27 06:45:09,926 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-08-27 06:45:09,927 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 35 treesize of output 15 [2021-08-27 06:45:09,965 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:45:09,966 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 27 treesize of output 22 [2021-08-27 06:45:10,023 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:45:10,023 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 06:45:10,073 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:45:10,073 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 29 [2021-08-27 06:45:10,235 INFO L354 Elim1Store]: treesize reduction 70, result has 26.3 percent of original size [2021-08-27 06:45:10,236 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 60 treesize of output 44 [2021-08-27 06:45:10,298 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:45:10,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 06:45:10,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-08-27 06:45:10,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530674965] [2021-08-27 06:45:10,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 06:45:10,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:10,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 06:45:10,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2021-08-27 06:45:10,300 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 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 06:45:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:11,219 INFO L93 Difference]: Finished difference Result 243 states and 266 transitions. [2021-08-27 06:45:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-27 06:45:11,219 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 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 06:45:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:11,220 INFO L225 Difference]: With dead ends: 243 [2021-08-27 06:45:11,220 INFO L226 Difference]: Without dead ends: 243 [2021-08-27 06:45:11,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 811.2ms TimeCoverageRelationStatistics Valid=334, Invalid=2116, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 06:45:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-08-27 06:45:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 187. [2021-08-27 06:45:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 164 states have (on average 1.25) internal successors, (205), 183 states have internal predecessors, (205), 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 06:45:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2021-08-27 06:45:11,224 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 35 [2021-08-27 06:45:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:11,224 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2021-08-27 06:45:11,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 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 06:45:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2021-08-27 06:45:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 06:45:11,225 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:11,225 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-08-27 06:45:11,245 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 06:45:11,441 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,SelfDestructingSolverStorable23 [2021-08-27 06:45:11,442 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:11,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1022599575, now seen corresponding path program 2 times [2021-08-27 06:45:11,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:11,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655736541] [2021-08-27 06:45:11,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:11,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:11,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:11,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655736541] [2021-08-27 06:45:11,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655736541] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:11,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702666507] [2021-08-27 06:45:11,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 06:45:11,847 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:11,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:45:11,848 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 06:45:11,850 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 06:45:12,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 06:45:12,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 06:45:12,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 52 conjunts are in the unsatisfiable core [2021-08-27 06:45:12,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:12,275 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 06:45:12,374 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:45:12,374 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 06:45:12,411 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 06:45:12,418 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 16 treesize of output 12 [2021-08-27 06:45:12,575 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-08-27 06:45:12,585 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 35 treesize of output 15 [2021-08-27 06:45:12,596 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 27 treesize of output 11 [2021-08-27 06:45:12,667 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:45:12,667 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 06:45:12,685 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:45:12,685 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 27 treesize of output 22 [2021-08-27 06:45:12,803 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:45:12,803 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 06:45:12,912 INFO L354 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2021-08-27 06:45:12,913 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 26 treesize of output 29 [2021-08-27 06:45:12,930 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:45:12,930 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 29 [2021-08-27 06:45:13,170 INFO L354 Elim1Store]: treesize reduction 70, result has 26.3 percent of original size [2021-08-27 06:45:13,171 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 49 [2021-08-27 06:45:13,200 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 27 treesize of output 11 [2021-08-27 06:45:13,295 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-08-27 06:45:13,295 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 81 treesize of output 82 [2021-08-27 06:45:13,306 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:45:13,307 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 92 treesize of output 91 [2021-08-27 06:45:14,215 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:45:14,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 06:45:14,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-08-27 06:45:14,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409495292] [2021-08-27 06:45:14,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 06:45:14,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 06:45:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2021-08-27 06:45:14,217 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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 06:45:15,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:15,302 INFO L93 Difference]: Finished difference Result 252 states and 277 transitions. [2021-08-27 06:45:15,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 06:45:15,303 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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 06:45:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:15,304 INFO L225 Difference]: With dead ends: 252 [2021-08-27 06:45:15,304 INFO L226 Difference]: Without dead ends: 252 [2021-08-27 06:45:15,304 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1176.4ms TimeCoverageRelationStatistics Valid=246, Invalid=2010, Unknown=0, NotChecked=0, Total=2256 [2021-08-27 06:45:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-08-27 06:45:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 189. [2021-08-27 06:45:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 166 states have (on average 1.2530120481927711) internal successors, (208), 185 states have internal predecessors, (208), 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 06:45:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2021-08-27 06:45:15,313 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 35 [2021-08-27 06:45:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:15,313 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2021-08-27 06:45:15,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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 06:45:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2021-08-27 06:45:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:45:15,314 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:15,315 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] [2021-08-27 06:45:15,335 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 06:45:15,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-08-27 06:45:15,533 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:15,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:15,533 INFO L82 PathProgramCache]: Analyzing trace with hash -21569070, now seen corresponding path program 1 times [2021-08-27 06:45:15,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:15,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153820622] [2021-08-27 06:45:15,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:15,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:15,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:15,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:15,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153820622] [2021-08-27 06:45:15,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153820622] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:15,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414102567] [2021-08-27 06:45:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:15,731 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:15,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:45:15,732 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 06:45:15,734 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 06:45:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:16,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-27 06:45:16,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:16,326 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 06:45:16,331 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 06:45:16,490 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:45:16,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 35 treesize of output 30 [2021-08-27 06:45:16,496 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:45:16,497 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 24 treesize of output 19 [2021-08-27 06:45:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:16,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414102567] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:16,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:45:16,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2021-08-27 06:45:16,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926714790] [2021-08-27 06:45:16,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 06:45:16,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 06:45:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-08-27 06:45:16,527 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 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 06:45:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:17,338 INFO L93 Difference]: Finished difference Result 230 states and 253 transitions. [2021-08-27 06:45:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 06:45:17,339 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 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 36 [2021-08-27 06:45:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:17,340 INFO L225 Difference]: With dead ends: 230 [2021-08-27 06:45:17,340 INFO L226 Difference]: Without dead ends: 230 [2021-08-27 06:45:17,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 442.0ms TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2021-08-27 06:45:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-27 06:45:17,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2021-08-27 06:45:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 177 states have (on average 1.2429378531073447) internal successors, (220), 196 states have internal predecessors, (220), 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 06:45:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2021-08-27 06:45:17,344 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 36 [2021-08-27 06:45:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:17,345 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2021-08-27 06:45:17,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 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 06:45:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2021-08-27 06:45:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:45:17,346 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:17,346 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] [2021-08-27 06:45:17,391 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 06:45:17,560 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,SelfDestructingSolverStorable25 [2021-08-27 06:45:17,560 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:17,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1852042457, now seen corresponding path program 1 times [2021-08-27 06:45:17,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:17,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819152807] [2021-08-27 06:45:17,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:17,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:17,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:17,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819152807] [2021-08-27 06:45:17,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819152807] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:17,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417455729] [2021-08-27 06:45:17,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:17,732 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:45:17,733 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 06:45:17,746 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 06:45:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:18,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-27 06:45:18,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:18,309 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 06:45:18,334 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:45:18,334 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 06:45:18,359 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 16 treesize of output 12 [2021-08-27 06:45:18,637 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:45:18,637 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 31 treesize of output 27 [2021-08-27 06:45:18,828 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:45:18,828 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 18 [2021-08-27 06:45:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:18,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417455729] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:18,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:45:18,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2021-08-27 06:45:18,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749106981] [2021-08-27 06:45:18,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-27 06:45:18,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:18,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-27 06:45:18,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2021-08-27 06:45:18,877 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 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 06:45:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:19,764 INFO L93 Difference]: Finished difference Result 232 states and 255 transitions. [2021-08-27 06:45:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 06:45:19,765 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 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 36 [2021-08-27 06:45:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:19,766 INFO L225 Difference]: With dead ends: 232 [2021-08-27 06:45:19,766 INFO L226 Difference]: Without dead ends: 232 [2021-08-27 06:45:19,766 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 725.5ms TimeCoverageRelationStatistics Valid=266, Invalid=1626, Unknown=0, NotChecked=0, Total=1892 [2021-08-27 06:45:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-08-27 06:45:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2021-08-27 06:45:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 191 states have (on average 1.2617801047120418) internal successors, (241), 210 states have internal predecessors, (241), 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 06:45:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 244 transitions. [2021-08-27 06:45:19,795 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 244 transitions. Word has length 36 [2021-08-27 06:45:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:19,795 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 244 transitions. [2021-08-27 06:45:19,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 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 06:45:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 244 transitions. [2021-08-27 06:45:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:45:19,796 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:19,796 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] [2021-08-27 06:45:19,822 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 06:45:19,996 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,SelfDestructingSolverStorable26 [2021-08-27 06:45:19,997 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr40REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1852042456, now seen corresponding path program 1 times [2021-08-27 06:45:19,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:19,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369007891] [2021-08-27 06:45:19,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:19,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:20,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:20,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:20,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369007891] [2021-08-27 06:45:20,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369007891] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:20,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703185857] [2021-08-27 06:45:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:20,133 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:20,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:45:20,149 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 06:45:20,150 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 06:45:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:20,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-27 06:45:20,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:20,760 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 06:45:20,765 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 06:45:21,007 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:45:21,008 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 37 treesize of output 37 [2021-08-27 06:45:21,014 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:45:21,014 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 31 treesize of output 31 [2021-08-27 06:45:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:21,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703185857] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:21,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:45:21,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2021-08-27 06:45:21,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764303206] [2021-08-27 06:45:21,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-27 06:45:21,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:21,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-27 06:45:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-08-27 06:45:21,167 INFO L87 Difference]: Start difference. First operand 214 states and 244 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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 06:45:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:22,235 INFO L93 Difference]: Finished difference Result 233 states and 256 transitions. [2021-08-27 06:45:22,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 06:45:22,235 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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 36 [2021-08-27 06:45:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:22,236 INFO L225 Difference]: With dead ends: 233 [2021-08-27 06:45:22,236 INFO L226 Difference]: Without dead ends: 233 [2021-08-27 06:45:22,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 682.0ms TimeCoverageRelationStatistics Valid=263, Invalid=1459, Unknown=0, NotChecked=0, Total=1722 [2021-08-27 06:45:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-08-27 06:45:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 216. [2021-08-27 06:45:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 193 states have (on average 1.2538860103626943) internal successors, (242), 212 states have internal predecessors, (242), 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 06:45:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 245 transitions. [2021-08-27 06:45:22,240 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 245 transitions. Word has length 36 [2021-08-27 06:45:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:22,240 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 245 transitions. [2021-08-27 06:45:22,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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 06:45:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 245 transitions. [2021-08-27 06:45:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:45:22,241 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:22,241 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 06:45:22,259 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 06:45:22,453 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,SelfDestructingSolverStorable27 [2021-08-27 06:45:22,453 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash 606496624, now seen corresponding path program 1 times [2021-08-27 06:45:22,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:22,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808042224] [2021-08-27 06:45:22,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:22,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:22,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:22,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:22,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808042224] [2021-08-27 06:45:22,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808042224] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:22,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011573587] [2021-08-27 06:45:22,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:22,671 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:22,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:45:22,685 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 06:45:22,725 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 06:45:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:23,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-27 06:45:23,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:23,355 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 06:45:23,446 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:45:23,447 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 06:45:23,510 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 21 treesize of output 17 [2021-08-27 06:45:23,652 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-08-27 06:45:23,652 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 44 treesize of output 20 [2021-08-27 06:45:23,678 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:45:23,679 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2021-08-27 06:45:23,801 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-08-27 06:45:23,801 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 06:45:23,876 INFO L354 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2021-08-27 06:45:23,877 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 56 treesize of output 34 [2021-08-27 06:45:23,918 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-08-27 06:45:23,919 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 57 treesize of output 50 [2021-08-27 06:45:23,933 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 06:45:24,162 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 92 treesize of output 84 [2021-08-27 06:45:24,366 INFO L354 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2021-08-27 06:45:24,367 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 82 treesize of output 40 [2021-08-27 06:45:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:27,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011573587] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:27,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:45:27,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2021-08-27 06:45:27,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816221604] [2021-08-27 06:45:27,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-27 06:45:27,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:27,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-27 06:45:27,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=907, Unknown=1, NotChecked=0, Total=1056 [2021-08-27 06:45:27,225 INFO L87 Difference]: Start difference. First operand 216 states and 245 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 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 06:45:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:48,294 INFO L93 Difference]: Finished difference Result 285 states and 313 transitions. [2021-08-27 06:45:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-08-27 06:45:48,294 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 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 36 [2021-08-27 06:45:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:48,295 INFO L225 Difference]: With dead ends: 285 [2021-08-27 06:45:48,295 INFO L226 Difference]: Without dead ends: 285 [2021-08-27 06:45:48,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 20728.1ms TimeCoverageRelationStatistics Valid=586, Invalid=2948, Unknown=6, NotChecked=0, Total=3540 [2021-08-27 06:45:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-08-27 06:45:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 220. [2021-08-27 06:45:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 197 states have (on average 1.2588832487309645) internal successors, (248), 216 states have internal predecessors, (248), 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 06:45:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2021-08-27 06:45:48,299 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 36 [2021-08-27 06:45:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:48,299 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2021-08-27 06:45:48,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 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 06:45:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2021-08-27 06:45:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:45:48,299 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:48,299 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 06:45:48,318 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 06:45:48,502 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,SelfDestructingSolverStorable28 [2021-08-27 06:45:48,502 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:48,503 INFO L82 PathProgramCache]: Analyzing trace with hash 606496625, now seen corresponding path program 1 times [2021-08-27 06:45:48,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:48,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220025914] [2021-08-27 06:45:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:48,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:48,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:45:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:48,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:45:48,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220025914] [2021-08-27 06:45:48,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220025914] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:48,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803698112] [2021-08-27 06:45:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:48,903 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:48,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:45:48,911 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 06:45:48,913 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 06:45:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:49,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 59 conjunts are in the unsatisfiable core [2021-08-27 06:45:49,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:49,695 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 06:45:49,833 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:45:49,833 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 06:45:49,880 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:45:49,948 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 06:45:49,956 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 26 treesize of output 22 [2021-08-27 06:45:50,181 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-08-27 06:45:50,181 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 25 [2021-08-27 06:45:50,191 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 27 treesize of output 11 [2021-08-27 06:45:50,239 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:45:50,239 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 50 [2021-08-27 06:45:50,262 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:45:50,262 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 64 treesize of output 59 [2021-08-27 06:45:50,445 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-27 06:45:50,445 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 1 case distinctions, treesize of input 16 treesize of output 18 [2021-08-27 06:45:50,467 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-08-27 06:45:50,468 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 20 treesize of output 22 [2021-08-27 06:45:50,539 INFO L354 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2021-08-27 06:45:50,539 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 93 treesize of output 67 [2021-08-27 06:45:50,550 INFO L354 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2021-08-27 06:45:50,550 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 61 [2021-08-27 06:45:50,603 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-08-27 06:45:50,604 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 81 treesize of output 70 [2021-08-27 06:45:50,620 INFO L354 Elim1Store]: treesize reduction 100, result has 21.3 percent of original size [2021-08-27 06:45:50,621 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 102 treesize of output 104 [2021-08-27 06:45:51,204 INFO L354 Elim1Store]: treesize reduction 69, result has 10.4 percent of original size [2021-08-27 06:45:51,205 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 70 [2021-08-27 06:45:51,218 INFO L354 Elim1Store]: treesize reduction 62, result has 4.6 percent of original size [2021-08-27 06:45:51,218 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 55 treesize of output 41 [2021-08-27 06:45:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:51,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803698112] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:45:51,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:45:51,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2021-08-27 06:45:51,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844791701] [2021-08-27 06:45:51,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-27 06:45:51,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:45:51,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-27 06:45:51,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2021-08-27 06:45:51,317 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 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 06:45:52,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:52,947 INFO L93 Difference]: Finished difference Result 265 states and 292 transitions. [2021-08-27 06:45:52,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 06:45:52,947 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 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 36 [2021-08-27 06:45:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:52,948 INFO L225 Difference]: With dead ends: 265 [2021-08-27 06:45:52,948 INFO L226 Difference]: Without dead ends: 265 [2021-08-27 06:45:52,948 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1353.2ms TimeCoverageRelationStatistics Valid=262, Invalid=1900, Unknown=0, NotChecked=0, Total=2162 [2021-08-27 06:45:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-08-27 06:45:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 219. [2021-08-27 06:45:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 196 states have (on average 1.2551020408163265) internal successors, (246), 215 states have internal predecessors, (246), 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 06:45:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 249 transitions. [2021-08-27 06:45:52,951 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 249 transitions. Word has length 36 [2021-08-27 06:45:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:52,951 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 249 transitions. [2021-08-27 06:45:52,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 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 06:45:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 249 transitions. [2021-08-27 06:45:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-27 06:45:52,951 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:52,951 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, 1, 1, 1, 1, 1, 1] [2021-08-27 06:45:52,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-27 06:45:53,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:45:53,152 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr44ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:53,152 INFO L82 PathProgramCache]: Analyzing trace with hash -668642533, now seen corresponding path program 1 times [2021-08-27 06:45:53,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:45:53,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055414303] [2021-08-27 06:45:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:53,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:45:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:45:53,164 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 06:45:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:45:53,192 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 06:45:53,193 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 06:45:53,193 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr44ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:45:53,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:45:53,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:45:53,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:45:53,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:45:53,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:45:53,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:45:53,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:45:53,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:45:53,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:45:53,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:45:53,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:45:53,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:45:53,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:45:53,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:45:53,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:45:53,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:45:53,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:45:53,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:45:53,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:45:53,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:45:53,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:45:53,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:45:53,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:45:53,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:45:53,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:45:53,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:45:53,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 06:45:53,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:45:53,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:45:53,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:45:53,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:45:53,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 06:45:53,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 06:45:53,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:45:53,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:45:53,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 06:45:53,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:45:53,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:45:53,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:45:53,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:45:53,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 06:45:53,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:45:53,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:45:53,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:45:53,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 06:45:53,206 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:45:53,223 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 06:45:53,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:45:53 BoogieIcfgContainer [2021-08-27 06:45:53,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:45:53,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:45:53,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:45:53,244 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:45:53,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:44:47" (3/4) ... [2021-08-27 06:45:53,246 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:45:53,246 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:45:53,247 INFO L168 Benchmark]: Toolchain (without parser) took 66826.98 ms. Allocated memory was 52.4 MB in the beginning and 616.6 MB in the end (delta: 564.1 MB). Free memory was 28.3 MB in the beginning and 528.2 MB in the end (delta: -499.9 MB). Peak memory consumption was 64.7 MB. Max. memory is 16.1 GB. [2021-08-27 06:45:53,247 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 52.4 MB. Free memory was 34.6 MB in the beginning and 34.6 MB in the end (delta: 71.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:45:53,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.95 ms. Allocated memory was 52.4 MB in the beginning and 67.1 MB in the end (delta: 14.7 MB). Free memory was 28.1 MB in the beginning and 44.3 MB in the end (delta: -16.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:45:53,247 INFO L168 Benchmark]: Boogie Preprocessor took 79.02 ms. Allocated memory is still 67.1 MB. Free memory was 44.3 MB in the beginning and 41.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:45:53,248 INFO L168 Benchmark]: RCFGBuilder took 594.73 ms. Allocated memory is still 67.1 MB. Free memory was 41.4 MB in the beginning and 34.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:45:53,248 INFO L168 Benchmark]: TraceAbstraction took 65776.38 ms. Allocated memory was 67.1 MB in the beginning and 616.6 MB in the end (delta: 549.5 MB). Free memory was 33.6 MB in the beginning and 529.3 MB in the end (delta: -495.6 MB). Peak memory consumption was 52.7 MB. Max. memory is 16.1 GB. [2021-08-27 06:45:53,248 INFO L168 Benchmark]: Witness Printer took 2.61 ms. Allocated memory is still 616.6 MB. Free memory was 529.3 MB in the beginning and 528.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:45:53,249 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.18 ms. Allocated memory is still 52.4 MB. Free memory was 34.6 MB in the beginning and 34.6 MB in the end (delta: 71.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 368.95 ms. Allocated memory was 52.4 MB in the beginning and 67.1 MB in the end (delta: 14.7 MB). Free memory was 28.1 MB in the beginning and 44.3 MB in the end (delta: -16.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 79.02 ms. Allocated memory is still 67.1 MB. Free memory was 44.3 MB in the beginning and 41.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 594.73 ms. Allocated memory is still 67.1 MB. Free memory was 41.4 MB in the beginning and 34.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 65776.38 ms. Allocated memory was 67.1 MB in the beginning and 616.6 MB in the end (delta: 549.5 MB). Free memory was 33.6 MB in the beginning and 529.3 MB in the end (delta: -495.6 MB). Peak memory consumption was 52.7 MB. Max. memory is 16.1 GB. * Witness Printer took 2.61 ms. Allocated memory is still 616.6 MB. Free memory was 529.3 MB in the beginning and 528.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L999] SLL* head = malloc(sizeof(SLL)); [L1000] head->next = ((void*)0) VAL [head={-2:0}] [L1001] head->data = 0 VAL [head={-2:0}] [L1003] SLL* x = head; VAL [head={-2:0}, x={-2:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1016] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x = head VAL [head={-2:0}, x={-2:0}] [L1026] x->next VAL [head={-2:0}, x={-2:0}, x->next={0:0}] [L1026] COND FALSE !(x->next) [L1033] EXPR x->next VAL [head={-2:0}, x={-2:0}, x->next={0:0}] [L1033] SLL* y = x->next; [L1034] x->next = malloc(sizeof(SLL)) VAL [head={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}, y={0:0}] [L1035] x->data = 1 VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1036] x->next = y VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1040] x = head VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1043] EXPR x->data VAL [head={-2:0}, x={-2:0}, x->data=1, y={0:0}] [L1043] COND FALSE !(x->data != 1) [L1049] EXPR x->next VAL [head={-2:0}, x={-2:0}, x->next={0:0}, y={0:0}] [L1049] x = x->next [L1050] COND FALSE !(\read(*x)) VAL [head={-2:0}, x={0:0}, y={0:0}] [L1058] x = head VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1059] COND TRUE x != ((void*)0) [L1061] head = x VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1062] EXPR x->next VAL [head={-2:0}, x={-2:0}, x->next={0:0}, y={0:0}] [L1062] x = x->next [L1063] free(head) VAL [head={-2:0}, x={0:0}, y={0:0}] [L1063] free(head) VAL [head={-2:0}, x={0:0}, y={0:0}] [L1063] free(head) [L1059] COND FALSE !(x != ((void*)0)) VAL [head={-2:0}, x={0:0}, y={0:0}] [L1066] return 0; VAL [\result=0, head={-2:0}, x={0:0}, y={0:0}] - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 107 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 65704.1ms, OverallIterations: 31, TraceHistogramMax: 3, EmptinessCheckTime: 22.4ms, AutomataDifference: 38881.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1683 SDtfs, 6117 SDslu, 7817 SDs, 0 SdLazy, 20245 SolverSat, 1711 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 13231.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1048 GetRequests, 355 SyntacticMatches, 21 SemanticMatches, 672 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5325 ImplicationChecksByTransitivity, 30947.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=29, InterpolantAutomatonStates: 464, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 147.5ms AutomataMinimizationTime, 30 MinimizatonAttempts, 1068 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 133.1ms SsaConstructionTime, 556.1ms SatisfiabilityAnalysisTime, 14920.6ms InterpolantComputationTime, 1177 NumberOfCodeBlocks, 1177 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1098 ConstructedInterpolants, 81 QuantifiedInterpolants, 16024 SizeOfPredicates, 167 NumberOfNonLiveVariables, 2295 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 42 InterpolantComputations, 16 PerfectInterpolantSequences, 22/108 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 06:45:53,306 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 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:45:55,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:45:55,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:45:55,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:45:55,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:45:55,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:45:55,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:45:55,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:45:55,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:45:55,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:45:55,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:45:55,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:45:55,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:45:55,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:45:55,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:45:55,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:45:55,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:45:55,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:45:55,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:45:55,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:45:55,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:45:55,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:45:55,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:45:55,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:45:55,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:45:55,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:45:55,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:45:55,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:45:55,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:45:55,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:45:55,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:45:55,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:45:55,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:45:55,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:45:55,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:45:55,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:45:55,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:45:55,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:45:55,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:45:55,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:45:55,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:45:55,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 06:45:55,426 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:45:55,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:45:55,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:45:55,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:45:55,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:45:55,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:45:55,429 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:45:55,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:45:55,429 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:45:55,429 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:45:55,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:45:55,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:45:55,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:45:55,430 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:45:55,430 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:45:55,430 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:45:55,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:45:55,437 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:45:55,437 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 06:45:55,437 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 06:45:55,437 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:45:55,437 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:45:55,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:45:55,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:45:55,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:45:55,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:45:55,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:45:55,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:45:55,438 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 06:45:55,438 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 06:45:55,438 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:45:55,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 06:45:55,439 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 -> 9d82c8ca4c880c13a152abb4a8dcf1f5948563b2 [2021-08-27 06:45:55,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:45:55,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:45:55,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:45:55,704 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:45:55,704 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:45:55,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2021-08-27 06:45:55,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66592cb9/6c00dc33183f419d90a3bf866ec985c2/FLAG440ec59e2 [2021-08-27 06:45:56,189 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:45:56,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2021-08-27 06:45:56,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66592cb9/6c00dc33183f419d90a3bf866ec985c2/FLAG440ec59e2 [2021-08-27 06:45:56,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66592cb9/6c00dc33183f419d90a3bf866ec985c2 [2021-08-27 06:45:56,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:45:56,232 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:45:56,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:45:56,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:45:56,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:45:56,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:45:56" (1/1) ... [2021-08-27 06:45:56,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aad2d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:45:56, skipping insertion in model container [2021-08-27 06:45:56,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:45:56" (1/1) ... [2021-08-27 06:45:56,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:45:56,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:45:56,540 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2021-08-27 06:45:56,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:45:56,565 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:45:56,615 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2021-08-27 06:45:56,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:45:56,661 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:45:56,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:45:56 WrapperNode [2021-08-27 06:45:56,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:45:56,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:45:56,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:45:56,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:45:56,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:45:56" (1/1) ... [2021-08-27 06:45:56,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:45:56" (1/1) ... [2021-08-27 06:45:56,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:45:56" (1/1) ... [2021-08-27 06:45:56,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:45:56" (1/1) ... [2021-08-27 06:45:56,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:45:56" (1/1) ... [2021-08-27 06:45:56,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:45:56" (1/1) ... [2021-08-27 06:45:56,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:45:56" (1/1) ... [2021-08-27 06:45:56,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:45:56,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:45:56,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:45:56,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:45:56,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:45:56" (1/1) ... [2021-08-27 06:45:56,773 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:45:56,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:45:56,790 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 06:45:56,809 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 06:45:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:45:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:45:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:45:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:45:56,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:45:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:45:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:45:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:45:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:45:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:45:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:45:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:45:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:45:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:45:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:45:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:45:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:45:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:45:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:45:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:45:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:45:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:45:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:45:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:45:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:45:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:45:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:45:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:45:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:45:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:45:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:45:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:45:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:45:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:45:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:45:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:45:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:45:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:45:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:45:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:45:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:45:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:45:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:45:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:45:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:45:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:45:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:45:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:45:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:45:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:45:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:45:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:45:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:45:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:45:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:45:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:45:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:45:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:45:56,835 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:45:56,835 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:45:56,835 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:45:56,835 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:45:56,836 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:45:56,836 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:45:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:45:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:45:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:45:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:45:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:45:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:45:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:45:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 06:45:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:45:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:45:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 06:45:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 06:45:57,454 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:45:57,455 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-27 06:45:57,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:45:57 BoogieIcfgContainer [2021-08-27 06:45:57,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:45:57,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:45:57,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:45:57,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:45:57,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:45:56" (1/3) ... [2021-08-27 06:45:57,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f65c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:45:57, skipping insertion in model container [2021-08-27 06:45:57,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:45:56" (2/3) ... [2021-08-27 06:45:57,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f65c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:45:57, skipping insertion in model container [2021-08-27 06:45:57,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:45:57" (3/3) ... [2021-08-27 06:45:57,468 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2021-08-27 06:45:57,471 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:45:57,471 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2021-08-27 06:45:57,507 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:45:57,512 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 06:45:57,512 INFO L340 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2021-08-27 06:45:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 52 states have (on average 2.173076923076923) internal successors, (113), 97 states have internal predecessors, (113), 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 06:45:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:45:57,543 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:57,544 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:45:57,544 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash 891998390, now seen corresponding path program 1 times [2021-08-27 06:45:57,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:45:57,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219161211] [2021-08-27 06:45:57,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:57,556 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:45:57,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:45:57,592 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 06:45:57,619 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 06:45:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:57,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:45:57,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:57,877 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 06:45:57,892 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 06:45:57,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:45:57,939 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 06:45:57,939 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:45:57,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219161211] [2021-08-27 06:45:57,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219161211] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:45:57,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:45:57,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:45:57,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404976132] [2021-08-27 06:45:57,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:45:57,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:45:57,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:45:57,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:45:57,953 INFO L87 Difference]: Start difference. First operand has 102 states, 52 states have (on average 2.173076923076923) internal successors, (113), 97 states have internal predecessors, (113), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 06:45:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:58,142 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2021-08-27 06:45:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:45:58,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 7 [2021-08-27 06:45:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:58,149 INFO L225 Difference]: With dead ends: 129 [2021-08-27 06:45:58,149 INFO L226 Difference]: Without dead ends: 125 [2021-08-27 06:45:58,149 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:45:58,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-27 06:45:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 96. [2021-08-27 06:45:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 50 states have (on average 1.98) internal successors, (99), 92 states have internal predecessors, (99), 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 06:45:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2021-08-27 06:45:58,171 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 7 [2021-08-27 06:45:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:58,172 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2021-08-27 06:45:58,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 06:45:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2021-08-27 06:45:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:45:58,172 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:58,172 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:45:58,188 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 06:45:58,383 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 06:45:58,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:58,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:58,386 INFO L82 PathProgramCache]: Analyzing trace with hash 891998391, now seen corresponding path program 1 times [2021-08-27 06:45:58,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:45:58,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399684579] [2021-08-27 06:45:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:58,387 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:45:58,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:45:58,403 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 06:45:58,407 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 06:45:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:58,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:45:58,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:58,576 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 06:45:58,591 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 06:45:58,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:45:58,658 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 06:45:58,658 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:45:58,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399684579] [2021-08-27 06:45:58,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399684579] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:45:58,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:45:58,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 06:45:58,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087272449] [2021-08-27 06:45:58,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:45:58,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:45:58,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:45:58,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:45:58,662 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 06:45:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:58,923 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2021-08-27 06:45:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:45:58,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 7 [2021-08-27 06:45:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:58,930 INFO L225 Difference]: With dead ends: 123 [2021-08-27 06:45:58,930 INFO L226 Difference]: Without dead ends: 123 [2021-08-27 06:45:58,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:45:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-27 06:45:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2021-08-27 06:45:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 50 states have (on average 1.94) internal successors, (97), 90 states have internal predecessors, (97), 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 06:45:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2021-08-27 06:45:58,936 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 7 [2021-08-27 06:45:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:58,936 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2021-08-27 06:45:58,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 06:45:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2021-08-27 06:45:58,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 06:45:58,937 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:58,937 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:45:59,004 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 06:45:59,143 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 06:45:59,143 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:59,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash 222948282, now seen corresponding path program 1 times [2021-08-27 06:45:59,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:45:59,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334247060] [2021-08-27 06:45:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:59,144 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:45:59,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:45:59,145 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 06:45:59,176 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 06:45:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:59,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:45:59,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:59,314 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 06:45:59,363 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:45:59,364 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 21 treesize of output 26 [2021-08-27 06:45:59,392 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 06:45:59,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:45:59,458 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 06:45:59,458 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:45:59,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334247060] [2021-08-27 06:45:59,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334247060] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:45:59,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:45:59,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:45:59,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752646404] [2021-08-27 06:45:59,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:45:59,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:45:59,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:45:59,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:45:59,460 INFO L87 Difference]: Start difference. First operand 94 states and 100 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 06:45:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:59,699 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2021-08-27 06:45:59,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:45:59,699 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 11 [2021-08-27 06:45:59,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:59,700 INFO L225 Difference]: With dead ends: 97 [2021-08-27 06:45:59,700 INFO L226 Difference]: Without dead ends: 97 [2021-08-27 06:45:59,700 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:45:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-08-27 06:45:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2021-08-27 06:45:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 85 states have internal predecessors, (98), 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 06:45:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2021-08-27 06:45:59,705 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 11 [2021-08-27 06:45:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:59,706 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2021-08-27 06:45:59,706 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 06:45:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2021-08-27 06:45:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 06:45:59,706 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:59,706 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:45:59,715 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 06:45:59,913 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 06:45:59,913 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:45:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash 222948283, now seen corresponding path program 1 times [2021-08-27 06:45:59,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:45:59,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716050177] [2021-08-27 06:45:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:59,914 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:45:59,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:45:59,915 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 06:45:59,917 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 06:46:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:46:00,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 06:46:00,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:46:00,127 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 06:46:00,189 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:46:00,190 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 06:46:00,203 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 06:46:00,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:46:00,418 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 06:46:00,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:46:00,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716050177] [2021-08-27 06:46:00,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716050177] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:46:00,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:46:00,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2021-08-27 06:46:00,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402229614] [2021-08-27 06:46:00,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:46:00,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:46:00,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:46:00,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:46:00,420 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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 06:46:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:46:00,993 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2021-08-27 06:46:00,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:46:00,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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 06:46:00,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:46:00,995 INFO L225 Difference]: With dead ends: 113 [2021-08-27 06:46:00,995 INFO L226 Difference]: Without dead ends: 113 [2021-08-27 06:46:00,995 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 166.4ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:46:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-27 06:46:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2021-08-27 06:46:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 91 states have internal predecessors, (104), 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 06:46:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2021-08-27 06:46:01,000 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 11 [2021-08-27 06:46:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:46:01,000 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2021-08-27 06:46:01,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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 06:46:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2021-08-27 06:46:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:46:01,002 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:46:01,002 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:46:01,011 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 06:46:01,209 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 06:46:01,209 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:46:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:46:01,210 INFO L82 PathProgramCache]: Analyzing trace with hash 983785532, now seen corresponding path program 1 times [2021-08-27 06:46:01,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:46:01,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648886374] [2021-08-27 06:46:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:46:01,211 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:46:01,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:46:01,212 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 06:46:01,213 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 06:46:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:46:01,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 06:46:01,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:46:01,364 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 06:46:01,375 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 20 treesize of output 16 [2021-08-27 06:46:01,397 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 21 treesize of output 13 [2021-08-27 06:46:01,422 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 06:46:01,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:46:01,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 06:46:01,482 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:46:01,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648886374] [2021-08-27 06:46:01,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648886374] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:46:01,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:46:01,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:46:01,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560063151] [2021-08-27 06:46:01,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:46:01,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:46:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:46:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:46:01,483 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 06:46:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:46:01,810 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2021-08-27 06:46:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:46:01,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 15 [2021-08-27 06:46:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:46:01,812 INFO L225 Difference]: With dead ends: 95 [2021-08-27 06:46:01,812 INFO L226 Difference]: Without dead ends: 95 [2021-08-27 06:46:01,812 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 75.1ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:46:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-27 06:46:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2021-08-27 06:46:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 90 states have internal predecessors, (103), 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 06:46:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2021-08-27 06:46:01,816 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 15 [2021-08-27 06:46:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:46:01,816 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2021-08-27 06:46:01,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 06:46:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2021-08-27 06:46:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:46:01,816 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:46:01,816 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:46:01,825 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 06:46:02,023 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 06:46:02,023 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:46:02,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:46:02,023 INFO L82 PathProgramCache]: Analyzing trace with hash 983785533, now seen corresponding path program 1 times [2021-08-27 06:46:02,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:46:02,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552845974] [2021-08-27 06:46:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:46:02,024 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:46:02,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:46:02,025 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 06:46:02,027 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 06:46:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:46:02,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:46:02,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:46:02,202 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 06:46:02,223 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 06:46:02,229 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 06:46:02,265 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 31 treesize of output 23 [2021-08-27 06:46:02,270 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 20 treesize of output 12 [2021-08-27 06:46:02,299 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 06:46:02,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:46:02,512 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 06:46:02,512 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:46:02,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552845974] [2021-08-27 06:46:02,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552845974] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:46:02,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:46:02,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-08-27 06:46:02,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810998837] [2021-08-27 06:46:02,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:46:02,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:46:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:46:02,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:46:02,515 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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 06:46:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:46:03,403 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2021-08-27 06:46:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:46:03,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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 15 [2021-08-27 06:46:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:46:03,404 INFO L225 Difference]: With dead ends: 96 [2021-08-27 06:46:03,404 INFO L226 Difference]: Without dead ends: 96 [2021-08-27 06:46:03,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 243.8ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:46:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-27 06:46:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2021-08-27 06:46:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 85 states have internal predecessors, (97), 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 06:46:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2021-08-27 06:46:03,410 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 15 [2021-08-27 06:46:03,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:46:03,410 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2021-08-27 06:46:03,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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 06:46:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2021-08-27 06:46:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:46:03,412 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:46:03,413 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 06:46:03,419 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 06:46:03,613 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 06:46:03,613 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:46:03,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:46:03,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1308029040, now seen corresponding path program 1 times [2021-08-27 06:46:03,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:46:03,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377934907] [2021-08-27 06:46:03,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:46:03,615 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:46:03,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:46:03,618 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 06:46:03,618 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 06:46:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:46:03,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:46:03,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:46:03,820 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 06:46:03,824 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 06:46:03,850 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 06:46:03,850 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 27 treesize of output 11 [2021-08-27 06:46:03,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:46:03,856 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 27 treesize of output 11 [2021-08-27 06:46:03,896 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 06:46:03,899 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 06:46:03,918 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 06:46:03,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:46:04,011 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 06:46:04,012 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:46:04,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377934907] [2021-08-27 06:46:04,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377934907] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:46:04,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:46:04,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:46:04,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633306349] [2021-08-27 06:46:04,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:46:04,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:46:04,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:46:04,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:46:04,013 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 06:46:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:46:04,216 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2021-08-27 06:46:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:46:04,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 17 [2021-08-27 06:46:04,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:46:04,217 INFO L225 Difference]: With dead ends: 98 [2021-08-27 06:46:04,217 INFO L226 Difference]: Without dead ends: 98 [2021-08-27 06:46:04,217 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:46:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-27 06:46:04,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2021-08-27 06:46:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 89 states have internal predecessors, (103), 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 06:46:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2021-08-27 06:46:04,221 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 17 [2021-08-27 06:46:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:46:04,221 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2021-08-27 06:46:04,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 06:46:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2021-08-27 06:46:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:46:04,222 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:46:04,222 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 06:46:04,230 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 06:46:04,422 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 06:46:04,422 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:46:04,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:46:04,423 INFO L82 PathProgramCache]: Analyzing trace with hash 158378837, now seen corresponding path program 1 times [2021-08-27 06:46:04,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:46:04,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769438330] [2021-08-27 06:46:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:46:04,423 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:46:04,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:46:04,425 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 06:46:04,425 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 06:46:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:46:04,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:46:04,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:46:04,639 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 06:46:04,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:46:04,658 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 06:46:04,699 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 7 [2021-08-27 06:46:04,711 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 06:46:04,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:46:04,791 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 06:46:04,791 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:46:04,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769438330] [2021-08-27 06:46:04,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769438330] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:46:04,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:46:04,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 8 [2021-08-27 06:46:04,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219470271] [2021-08-27 06:46:04,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:46:04,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:46:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:46:04,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:46:04,793 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 06:46:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:46:05,050 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2021-08-27 06:46:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:46:05,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 06:46:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:46:05,052 INFO L225 Difference]: With dead ends: 123 [2021-08-27 06:46:05,052 INFO L226 Difference]: Without dead ends: 123 [2021-08-27 06:46:05,052 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 74.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:46:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-27 06:46:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2021-08-27 06:46:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 92 states have internal predecessors, (106), 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 06:46:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2021-08-27 06:46:05,055 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 20 [2021-08-27 06:46:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:46:05,055 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2021-08-27 06:46:05,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 06:46:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2021-08-27 06:46:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 06:46:05,056 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:46:05,056 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 06:46:05,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-08-27 06:46:05,263 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 06:46:05,264 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:46:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:46:05,264 INFO L82 PathProgramCache]: Analyzing trace with hash 613145829, now seen corresponding path program 1 times [2021-08-27 06:46:05,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:46:05,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634310733] [2021-08-27 06:46:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:46:05,264 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:46:05,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:46:05,265 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 06:46:05,267 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 06:46:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:46:05,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:46:05,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:46:05,483 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 06:46:05,518 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:46:05,519 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 20 treesize of output 25 [2021-08-27 06:46:05,557 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 31 treesize of output 27 [2021-08-27 06:46:05,653 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 43 treesize of output 35 [2021-08-27 06:46:05,708 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 06:46:05,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:46:05,833 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 06:46:05,834 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:46:05,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634310733] [2021-08-27 06:46:05,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634310733] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:46:05,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:46:05,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2021-08-27 06:46:05,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071061751] [2021-08-27 06:46:05,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:46:05,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:46:05,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:46:05,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:46:05,835 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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 06:46:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:46:06,444 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2021-08-27 06:46:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:46:06,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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 21 [2021-08-27 06:46:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:46:06,446 INFO L225 Difference]: With dead ends: 127 [2021-08-27 06:46:06,446 INFO L226 Difference]: Without dead ends: 127 [2021-08-27 06:46:06,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 13 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 226.2ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:46:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-08-27 06:46:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2021-08-27 06:46:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 96 states have internal predecessors, (112), 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 06:46:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2021-08-27 06:46:06,449 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 21 [2021-08-27 06:46:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:46:06,449 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2021-08-27 06:46:06,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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 06:46:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2021-08-27 06:46:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 06:46:06,453 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:46:06,453 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 06:46:06,495 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 06:46:06,654 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 06:46:06,654 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:46:06,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:46:06,654 INFO L82 PathProgramCache]: Analyzing trace with hash 613145830, now seen corresponding path program 1 times [2021-08-27 06:46:06,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:46:06,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260006769] [2021-08-27 06:46:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:46:06,655 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:46:06,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:46:06,656 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 06:46:06,665 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 06:46:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:46:06,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-27 06:46:06,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:46:06,930 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 06:46:06,986 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:46:06,986 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 06:46:07,024 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 06:46:07,031 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 06:46:07,123 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 36 treesize of output 28 [2021-08-27 06:46:07,126 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 25 treesize of output 17 [2021-08-27 06:46:07,196 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 06:46:07,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:46:07,825 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 06:46:07,825 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:46:07,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260006769] [2021-08-27 06:46:07,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260006769] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:46:07,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:46:07,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2021-08-27 06:46:07,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587477229] [2021-08-27 06:46:07,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:46:07,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:46:07,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:46:07,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:46:07,828 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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 06:46:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:46:09,083 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2021-08-27 06:46:09,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:46:09,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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 21 [2021-08-27 06:46:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:46:09,084 INFO L225 Difference]: With dead ends: 149 [2021-08-27 06:46:09,084 INFO L226 Difference]: Without dead ends: 149 [2021-08-27 06:46:09,084 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 703.0ms TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2021-08-27 06:46:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-08-27 06:46:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 102. [2021-08-27 06:46:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 98 states have internal predecessors, (114), 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 06:46:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2021-08-27 06:46:09,087 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 21 [2021-08-27 06:46:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:46:09,087 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2021-08-27 06:46:09,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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 06:46:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2021-08-27 06:46:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:46:09,088 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:46:09,088 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 06:46:09,095 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 06:46:09,295 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 06:46:09,295 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr36ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:46:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:46:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash 822626090, now seen corresponding path program 1 times [2021-08-27 06:46:09,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:46:09,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771317134] [2021-08-27 06:46:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:46:09,296 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:46:09,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:46:09,297 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 06:46:09,298 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 06:46:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:46:09,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 06:46:09,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:46:09,558 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 06:46:09,572 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 06:46:09,618 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:46:09,618 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 06:46:09,649 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 06:46:09,698 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 60 treesize of output 56 [2021-08-27 06:46:09,735 INFO L354 Elim1Store]: treesize reduction 92, result has 20.0 percent of original size [2021-08-27 06:46:09,735 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 57 treesize of output 48 [2021-08-27 06:46:09,738 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 42 treesize of output 38 [2021-08-27 06:46:09,856 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 49 treesize of output 37 [2021-08-27 06:46:09,859 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 34 treesize of output 26 [2021-08-27 06:46:09,977 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-08-27 06:46:09,978 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 32 treesize of output 14 [2021-08-27 06:46:10,000 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 06:46:10,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:46:33,904 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 06:46:33,905 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:46:33,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771317134] [2021-08-27 06:46:33,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771317134] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:46:33,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:46:33,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 19 [2021-08-27 06:46:33,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195637926] [2021-08-27 06:46:33,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 06:46:33,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:46:33,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 06:46:33,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=283, Unknown=11, NotChecked=0, Total=342 [2021-08-27 06:46:33,907 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 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 06:46:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:46:39,915 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2021-08-27 06:46:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 06:46:39,916 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 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 23 [2021-08-27 06:46:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:46:39,916 INFO L225 Difference]: With dead ends: 167 [2021-08-27 06:46:39,916 INFO L226 Difference]: Without dead ends: 167 [2021-08-27 06:46:39,917 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 26425.4ms TimeCoverageRelationStatistics Valid=139, Invalid=719, Unknown=12, NotChecked=0, Total=870 [2021-08-27 06:46:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-08-27 06:46:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 113. [2021-08-27 06:46:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 109 states have internal predecessors, (126), 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 06:46:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2021-08-27 06:46:39,919 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 23 [2021-08-27 06:46:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:46:39,919 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2021-08-27 06:46:39,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 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 06:46:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2021-08-27 06:46:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:46:39,920 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:46:39,920 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] [2021-08-27 06:46:39,929 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 06:46:40,120 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 06:46:40,120 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr44ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:46:40,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:46:40,121 INFO L82 PathProgramCache]: Analyzing trace with hash -269223688, now seen corresponding path program 1 times [2021-08-27 06:46:40,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:46:40,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146251460] [2021-08-27 06:46:40,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:46:40,121 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:46:40,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:46:40,137 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 06:46:40,138 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 06:46:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:46:40,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:46:40,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:46:40,441 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 16 treesize of output 12 [2021-08-27 06:46:40,480 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 16 treesize of output 8 [2021-08-27 06:46:40,510 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 06:46:40,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:46:40,589 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 06:46:40,589 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:46:40,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146251460] [2021-08-27 06:46:40,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146251460] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:46:40,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:46:40,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-08-27 06:46:40,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772416464] [2021-08-27 06:46:40,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:46:40,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:46:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:46:40,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:46:40,592 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 06:46:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:46:41,022 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2021-08-27 06:46:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:46:41,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 24 [2021-08-27 06:46:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:46:41,023 INFO L225 Difference]: With dead ends: 153 [2021-08-27 06:46:41,023 INFO L226 Difference]: Without dead ends: 153 [2021-08-27 06:46:41,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 87.7ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:46:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-08-27 06:46:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 113. [2021-08-27 06:46:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 109 states have internal predecessors, (123), 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 06:46:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2021-08-27 06:46:41,026 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 24 [2021-08-27 06:46:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:46:41,026 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2021-08-27 06:46:41,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 06:46:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2021-08-27 06:46:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:46:41,027 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:46:41,027 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] [2021-08-27 06:46:41,053 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 06:46:41,235 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 06:46:41,235 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:46:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:46:41,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1777986568, now seen corresponding path program 1 times [2021-08-27 06:46:41,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:46:41,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982819984] [2021-08-27 06:46:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:46:41,237 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:46:41,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:46:41,237 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 06:46:41,239 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 06:46:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:46:41,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 06:46:41,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:46:41,548 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 06:46:41,627 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:46:41,628 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 24 treesize of output 31 [2021-08-27 06:46:41,679 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 06:46:41,836 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-08-27 06:46:41,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 50 treesize of output 26 [2021-08-27 06:46:41,885 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:46:41,885 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2021-08-27 06:46:42,063 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:46:42,064 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 43 [2021-08-27 06:46:42,160 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 06:46:42,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:46:44,298 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store (store (select |c_#memory_$Pointer$.base| c_main_~x~0.base) (bvadd (_ bv4 32) main_~x~0.offset) v_DerPreprocessor_5) main_~x~0.offset (_ bv0 32))) c_main_~head~0.base) c_main_~head~0.offset))))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:47:00,380 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 582 treesize of output 574 [2021-08-27 06:47:16,503 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 06:47:16,504 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:47:16,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982819984] [2021-08-27 06:47:16,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982819984] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:47:16,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:47:16,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2021-08-27 06:47:16,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268665888] [2021-08-27 06:47:16,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-27 06:47:16,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:47:16,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 06:47:16,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=367, Unknown=14, NotChecked=40, Total=506 [2021-08-27 06:47:16,506 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 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 06:49:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:49:12,202 INFO L93 Difference]: Finished difference Result 197 states and 222 transitions. [2021-08-27 06:49:12,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 06:49:12,203 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 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 24 [2021-08-27 06:49:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:49:12,203 INFO L225 Difference]: With dead ends: 197 [2021-08-27 06:49:12,203 INFO L226 Difference]: Without dead ends: 197 [2021-08-27 06:49:12,204 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 88108.6ms TimeCoverageRelationStatistics Valid=399, Invalid=1382, Unknown=29, NotChecked=82, Total=1892 [2021-08-27 06:49:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-27 06:49:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2021-08-27 06:49:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 123 states have internal predecessors, (142), 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 06:49:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2021-08-27 06:49:12,206 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 24 [2021-08-27 06:49:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:49:12,207 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2021-08-27 06:49:12,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 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 06:49:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2021-08-27 06:49:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:49:12,208 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:49:12,208 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] [2021-08-27 06:49:12,215 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 06:49:12,421 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 06:49:12,421 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:49:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:49:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1777986567, now seen corresponding path program 1 times [2021-08-27 06:49:12,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:49:12,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340207980] [2021-08-27 06:49:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:49:12,422 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:49:12,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:49:12,423 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 06:49:12,426 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 06:49:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:49:12,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 06:49:12,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:49:12,772 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 06:49:12,832 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:49:12,833 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 20 treesize of output 20 [2021-08-27 06:49:12,842 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:49:12,880 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 21 treesize of output 17 [2021-08-27 06:49:12,891 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 06:49:13,037 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-08-27 06:49:13,037 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 44 treesize of output 20 [2021-08-27 06:49:13,046 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 27 treesize of output 11 [2021-08-27 06:49:13,083 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:49:13,083 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 45 [2021-08-27 06:49:13,093 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:49:13,094 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 55 treesize of output 50 [2021-08-27 06:49:13,295 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:49:13,295 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2021-08-27 06:49:13,300 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:49:13,300 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 31 treesize of output 19 [2021-08-27 06:49:13,348 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 06:49:13,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:49:30,028 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) main_~x~0.offset))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base|) .cse0 v_DerPreprocessor_7) main_~x~0.offset (_ bv0 32))) c_main_~head~0.base) c_main_~head~0.offset) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem6.base|) .cse0 v_DerPreprocessor_6) main_~x~0.offset (_ bv0 32))) c_main_~head~0.base) c_main_~head~0.offset))))) (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base|) (bvadd (_ bv4 32) main_~x~0.offset) v_DerPreprocessor_7) main_~x~0.offset (_ bv0 32))) c_main_~head~0.base) c_main_~head~0.offset))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))) is different from false [2021-08-27 06:49:40,245 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 638 treesize of output 606 [2021-08-27 06:49:40,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:49:40,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:49:40,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:49:40,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:49:40,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:49:40,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:49:43,062 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 06:49:43,063 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:49:43,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340207980] [2021-08-27 06:49:43,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340207980] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:49:43,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:49:43,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2021-08-27 06:49:43,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110672837] [2021-08-27 06:49:43,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-27 06:49:43,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:49:43,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 06:49:43,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=397, Unknown=7, NotChecked=40, Total=506 [2021-08-27 06:49:43,066 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 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 06:50:20,338 WARN L207 SmtUtils]: Spent 30.50 s on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2021-08-27 06:51:00,881 WARN L207 SmtUtils]: Spent 24.70 s on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2021-08-27 06:51:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:51:02,400 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2021-08-27 06:51:02,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 06:51:02,401 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 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 24 [2021-08-27 06:51:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:51:02,402 INFO L225 Difference]: With dead ends: 185 [2021-08-27 06:51:02,402 INFO L226 Difference]: Without dead ends: 185 [2021-08-27 06:51:02,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 90947.5ms TimeCoverageRelationStatistics Valid=307, Invalid=1410, Unknown=9, NotChecked=80, Total=1806 [2021-08-27 06:51:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-27 06:51:02,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 126. [2021-08-27 06:51:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 122 states have internal predecessors, (140), 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 06:51:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2021-08-27 06:51:02,404 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 24 [2021-08-27 06:51:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:51:02,405 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2021-08-27 06:51:02,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 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 06:51:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2021-08-27 06:51:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:51:02,405 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:51:02,405 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 06:51:02,413 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 06:51:02,613 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 06:51:02,613 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:51:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:51:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash 220059809, now seen corresponding path program 1 times [2021-08-27 06:51:02,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:51:02,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881214479] [2021-08-27 06:51:02,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:51:02,614 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:51:02,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:51:02,615 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 06:51:02,616 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 06:51:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:51:02,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:51:02,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:51:03,076 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 06:51:03,114 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-27 06:51:03,114 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 25 treesize of output 13 [2021-08-27 06:51:03,146 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 19 treesize of output 7 [2021-08-27 06:51:03,165 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 06:51:03,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:51:03,236 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 200 treesize of output 188 [2021-08-27 06:51:03,377 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 06:51:03,377 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:51:03,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881214479] [2021-08-27 06:51:03,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881214479] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:51:03,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:51:03,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2021-08-27 06:51:03,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497054975] [2021-08-27 06:51:03,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:51:03,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:51:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:51:03,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:51:03,379 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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 06:51:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:51:04,312 INFO L93 Difference]: Finished difference Result 166 states and 186 transitions. [2021-08-27 06:51:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:51:04,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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 25 [2021-08-27 06:51:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:51:04,315 INFO L225 Difference]: With dead ends: 166 [2021-08-27 06:51:04,315 INFO L226 Difference]: Without dead ends: 166 [2021-08-27 06:51:04,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 98.5ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:51:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-08-27 06:51:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 138. [2021-08-27 06:51:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 134 states have internal predecessors, (154), 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 06:51:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2021-08-27 06:51:04,318 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 25 [2021-08-27 06:51:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:51:04,318 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2021-08-27 06:51:04,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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 06:51:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2021-08-27 06:51:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 06:51:04,319 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:51:04,319 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] [2021-08-27 06:51:04,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-08-27 06:51:04,519 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 06:51:04,519 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 40 more)] === [2021-08-27 06:51:04,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:51:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash -211374226, now seen corresponding path program 1 times [2021-08-27 06:51:04,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:51:04,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982936981] [2021-08-27 06:51:04,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:51:04,520 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:51:04,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:51:04,533 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 06:51:04,535 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 06:51:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:51:04,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 06:51:04,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:51:04,947 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 06:51:04,954 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 06:51:04,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:51:04,986 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 27 treesize of output 11 [2021-08-27 06:51:04,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:51:04,995 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 27 treesize of output 11 [2021-08-27 06:51:05,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:51:05,077 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 27 treesize of output 11 [2021-08-27 06:51:05,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:51:05,084 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 27 treesize of output 11 [2021-08-27 06:51:05,122 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-08-27 06:51:05,123 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 40 [2021-08-27 06:51:05,137 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-08-27 06:51:05,137 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 06:51:09,989 INFO L354 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2021-08-27 06:51:09,990 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 68 treesize of output 66 [2021-08-27 06:51:16,594 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 06:51:16,594 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 68 treesize of output 42 [2021-08-27 06:51:16,613 INFO L354 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2021-08-27 06:51:16,613 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 33 treesize of output 23 [2021-08-27 06:51:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:51:16,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:51:19,208 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-08-27 06:51:19,208 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 28 treesize of output 23 [2021-08-27 06:51:21,578 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~x~0.base (_ BitVec 32))) (or (and (= c_main_~head~0.offset c_main_~x~0.offset) (= c_main_~head~0.base main_~x~0.base)) (and (forall ((v_DerPreprocessor_9 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| main_~x~0.base (store (store (select |c_#memory_$Pointer$.offset| main_~x~0.base) (bvadd (_ bv4 32) c_main_~x~0.offset) v_DerPreprocessor_9) c_main_~x~0.offset c_main_~head~0.offset)) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32))) (forall ((v_DerPreprocessor_10 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.base| main_~x~0.base (store (store (select |c_#memory_$Pointer$.base| main_~x~0.base) (bvadd (_ bv4 32) c_main_~x~0.offset) v_DerPreprocessor_10) c_main_~x~0.offset c_main_~head~0.base)) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32)))))) is different from false [2021-08-27 06:51:23,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~x~0.base (_ BitVec 32))) (or (and (= c_main_~head~0.base main_~x~0.base) (= c_main_~head~0.offset (_ bv0 32))) (and (forall ((v_DerPreprocessor_9 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| main_~x~0.base (store (store (select |c_#memory_$Pointer$.offset| main_~x~0.base) (_ bv4 32) v_DerPreprocessor_9) (_ bv0 32) c_main_~head~0.offset)) c_main_~head~0.base) c_main_~head~0.offset))) (forall ((v_DerPreprocessor_10 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.base| main_~x~0.base (store (store (select |c_#memory_$Pointer$.base| main_~x~0.base) (_ bv4 32) v_DerPreprocessor_10) (_ bv0 32) c_main_~head~0.base)) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32)))))) is different from false [2021-08-27 06:51:23,771 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:51:23,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982936981] [2021-08-27 06:51:23,772 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:51:23,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [866599076] [2021-08-27 06:51:23,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:51:23,772 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 06:51:23,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 06:51:23,774 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 06:51:23,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2021-08-27 06:51:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:51:24,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-27 06:51:24,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:51:24,425 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 06:51:24,523 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 06:51:24,531 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 06:51:24,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:51:24,643 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 27 treesize of output 11 [2021-08-27 06:51:24,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:51:24,652 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 27 treesize of output 11 [2021-08-27 06:51:24,741 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:51:24,741 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 18 treesize of output 18 [2021-08-27 06:51:24,921 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 27 treesize of output 11 [2021-08-27 06:51:24,928 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 27 treesize of output 11 [2021-08-27 06:51:24,970 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 06:51:24,971 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 41 treesize of output 40 [2021-08-27 06:51:24,996 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-08-27 06:51:24,996 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 06:51:27,636 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 06:51:27,637 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 68 treesize of output 42 [2021-08-27 06:51:27,647 INFO L354 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2021-08-27 06:51:27,647 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 33 treesize of output 23 [2021-08-27 06:51:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:51:27,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:51:48,740 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:51:48,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38575673] [2021-08-27 06:51:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:51:48,740 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:51:48,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:51:48,741 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:51:48,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 06:51:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:51:49,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-27 06:51:49,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:51:49,258 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 06:51:49,263 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 06:51:51,358 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 06:51:51,359 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 27 treesize of output 11 [2021-08-27 06:51:51,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:51:51,366 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 27 treesize of output 11 [2021-08-27 06:51:51,419 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:51:51,419 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 06:51:51,499 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 27 treesize of output 11 [2021-08-27 06:51:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-08-27 06:51:51,532 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:51:51,532 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 41 treesize of output 40 [2021-08-27 06:51:51,546 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-08-27 06:51:51,546 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 38 treesize of output 37 [2021-08-27 06:51:56,232 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-08-27 06:51:56,232 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2021-08-27 06:51:56,250 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:51:56,250 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2021-08-27 06:51:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:51:56,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:52:08,720 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0.base_126 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_main_~x~0.base_126))) (and (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.base| v_main_~x~0.base_126 (store (store (select |c_#memory_$Pointer$.base| v_main_~x~0.base_126) (bvadd (_ bv4 32) main_~x~0.offset) v_DerPreprocessor_14) main_~x~0.offset c_main_~head~0.base)) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32))) (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| v_main_~x~0.base_126 (store (store (select |c_#memory_$Pointer$.offset| v_main_~x~0.base_126) (bvadd (_ bv4 32) main_~x~0.offset) v_DerPreprocessor_13) main_~x~0.offset c_main_~head~0.offset)) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32)))))) is different from false [2021-08-27 06:52:08,812 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:52:08,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:52:08,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 06:52:08,812 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 06:52:08,812 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 06:52:08,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:52:08,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:52:08,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:52:08,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:52:08,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:52:08,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:52:08,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:52:08,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:52:08,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:52:08,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:52:08,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:52:08,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:52:08,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:52:08,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:52:08,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:52:08,818 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:52:08,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:52:08,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:52:08,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:52:08,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:52:08,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:52:08,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:52:08,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:52:08,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:52:08,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:52:08,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:52:08,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:52:08,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 06:52:08,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:52:08,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:52:08,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:52:08,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:52:08,820 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 06:52:08,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 06:52:08,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:52:08,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 06:52:08,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:52:08,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:52:08,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:52:08,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:52:08,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 06:52:08,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:52:08,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:52:08,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:52:08,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:52:08,843 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 06:52:09,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2021-08-27 06:52:09,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-27 06:52:09,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:52:09,436 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:52:09,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:52:09 BoogieIcfgContainer [2021-08-27 06:52:09,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:52:09,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:52:09,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:52:09,446 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:52:09,446 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:45:57" (3/4) ... [2021-08-27 06:52:09,448 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:52:09,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:52:09,448 INFO L168 Benchmark]: Toolchain (without parser) took 373216.13 ms. Allocated memory was 52.4 MB in the beginning and 188.7 MB in the end (delta: 136.3 MB). Free memory was 28.0 MB in the beginning and 77.1 MB in the end (delta: -49.1 MB). Peak memory consumption was 87.9 MB. Max. memory is 16.1 GB. [2021-08-27 06:52:09,449 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 52.4 MB. Free memory was 34.5 MB in the beginning and 34.5 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:52:09,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.90 ms. Allocated memory was 52.4 MB in the beginning and 69.2 MB in the end (delta: 16.8 MB). Free memory was 27.8 MB in the beginning and 45.0 MB in the end (delta: -17.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:52:09,449 INFO L168 Benchmark]: Boogie Preprocessor took 102.44 ms. Allocated memory is still 69.2 MB. Free memory was 45.0 MB in the beginning and 41.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:52:09,449 INFO L168 Benchmark]: RCFGBuilder took 691.53 ms. Allocated memory is still 69.2 MB. Free memory was 41.9 MB in the beginning and 34.4 MB in the end (delta: 7.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:52:09,449 INFO L168 Benchmark]: TraceAbstraction took 371986.10 ms. Allocated memory was 69.2 MB in the beginning and 188.7 MB in the end (delta: 119.5 MB). Free memory was 33.9 MB in the beginning and 77.1 MB in the end (delta: -43.1 MB). Peak memory consumption was 75.7 MB. Max. memory is 16.1 GB. [2021-08-27 06:52:09,449 INFO L168 Benchmark]: Witness Printer took 2.37 ms. Allocated memory is still 188.7 MB. Free memory is still 77.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:52:09,450 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.09 ms. Allocated memory is still 52.4 MB. Free memory was 34.5 MB in the beginning and 34.5 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 427.90 ms. Allocated memory was 52.4 MB in the beginning and 69.2 MB in the end (delta: 16.8 MB). Free memory was 27.8 MB in the beginning and 45.0 MB in the end (delta: -17.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 102.44 ms. Allocated memory is still 69.2 MB. Free memory was 45.0 MB in the beginning and 41.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 691.53 ms. Allocated memory is still 69.2 MB. Free memory was 41.9 MB in the beginning and 34.4 MB in the end (delta: 7.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 371986.10 ms. Allocated memory was 69.2 MB in the beginning and 188.7 MB in the end (delta: 119.5 MB). Free memory was 33.9 MB in the beginning and 77.1 MB in the end (delta: -43.1 MB). Peak memory consumption was 75.7 MB. Max. memory is 16.1 GB. * Witness Printer took 2.37 ms. Allocated memory is still 188.7 MB. Free memory is still 77.1 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: 1052]: 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: [L999] SLL* head = malloc(sizeof(SLL)); [L1000] head->next = ((void*)0) [L1001] head->data = 0 [L1003] SLL* x = head; [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1016] COND TRUE __VERIFIER_nondet_int() [L1017] x = malloc(sizeof(SLL)) [L1018] x->data = 1 [L1019] x->next = head [L1020] head = x [L1040] x = head [L1043] EXPR x->data [L1043] COND FALSE !(x->data != 1) [L1049] EXPR x->next [L1049] x = x->next [L1050] COND TRUE \read(*x) [L1052] EXPR x->data [L1052] COND FALSE !(x->data == 1) [L1054] EXPR x->next [L1054] x = x->next [L1050] COND TRUE \read(*x) [L1052] x->data - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 996]: 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 5 procedures, 111 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 371929.6ms, OverallIterations: 16, TraceHistogramMax: 2, EmptinessCheckTime: 27.5ms, AutomataDifference: 207261.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 817 SDtfs, 2333 SDslu, 2685 SDs, 0 SdLazy, 5257 SolverSat, 629 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 84470.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 606 GetRequests, 355 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 207277.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=15, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 60.1ms AutomataMinimizationTime, 15 MinimizatonAttempts, 449 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 142.7ms SsaConstructionTime, 511.1ms SatisfiabilityAnalysisTime, 93193.2ms InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 500 ConstructedInterpolants, 62 QuantifiedInterpolants, 5725 SizeOfPredicates, 108 NumberOfNonLiveVariables, 1537 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 6/14 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 06:52:09,553 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 0 Received shutdown request...