./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:03:42,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:03:42,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:03:42,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:03:42,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:03:42,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:03:42,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:03:42,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:03:42,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:03:42,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:03:42,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:03:42,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:03:42,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:03:42,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:03:42,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:03:42,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:03:42,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:03:42,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:03:42,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:03:42,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:03:42,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:03:42,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:03:42,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:03:42,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:03:42,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:03:42,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:03:42,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:03:42,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:03:42,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:03:42,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:03:42,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:03:42,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:03:42,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:03:42,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:03:42,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:03:42,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:03:42,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:03:42,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:03:42,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:03:42,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:03:42,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:03:42,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 20:03:42,593 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:03:42,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:03:42,593 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:03:42,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:03:42,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:03:42,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:03:42,595 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:03:42,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:03:42,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 20:03:42,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:03:42,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:03:42,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:03:42,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:03:42,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:03:42,597 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:03:42,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:03:42,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:03:42,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:03:42,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:03:42,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:03:42,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:03:42,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:03:42,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:03:42,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 20:03:42,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 20:03:42,598 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:03:42,598 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:03:42,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:03:42,599 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:03:42,599 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 ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 [2021-11-22 20:03:42,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:03:42,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:03:42,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:03:42,835 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:03:42,836 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:03:42,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2021-11-22 20:03:42,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edefcab59/5bba104626954aa0886cada54068965c/FLAG270ea6546 [2021-11-22 20:03:43,437 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:03:43,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2021-11-22 20:03:43,470 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edefcab59/5bba104626954aa0886cada54068965c/FLAG270ea6546 [2021-11-22 20:03:43,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edefcab59/5bba104626954aa0886cada54068965c [2021-11-22 20:03:43,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:03:43,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:03:43,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:03:43,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:03:43,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:03:43,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:03:43" (1/1) ... [2021-11-22 20:03:43,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4324a7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:43, skipping insertion in model container [2021-11-22 20:03:43,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:03:43" (1/1) ... [2021-11-22 20:03:43,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:03:43,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:03:43,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4497,4510] [2021-11-22 20:03:43,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4557,4570] [2021-11-22 20:03:44,547 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,548 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,549 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,550 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,550 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,557 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,558 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,559 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,559 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,560 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,561 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,562 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,562 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:44,806 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:03:44,807 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:03:44,807 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:03:44,809 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:03:44,810 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:03:44,816 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:03:44,817 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:03:44,818 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:03:44,818 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:03:44,829 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:03:44,937 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:03:45,174 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,175 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,199 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,200 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,203 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,203 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,215 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,216 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,216 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,216 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,217 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,217 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,217 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:03:45,273 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:03:45,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4497,4510] [2021-11-22 20:03:45,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4557,4570] [2021-11-22 20:03:45,334 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,334 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,335 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,335 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,335 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,341 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,342 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,343 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,343 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,344 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,344 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,344 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,344 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,365 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:03:45,365 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:03:45,366 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:03:45,366 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:03:45,367 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:03:45,367 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:03:45,367 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:03:45,367 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:03:45,368 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:03:45,368 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:03:45,389 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:03:45,447 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,448 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,453 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,453 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,454 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,455 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,464 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,464 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,465 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,465 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,465 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,465 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,465 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:45,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:03:45,700 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:03:45,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45 WrapperNode [2021-11-22 20:03:45,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:03:45,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:03:45,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:03:45,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:03:45,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45" (1/1) ... [2021-11-22 20:03:45,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45" (1/1) ... [2021-11-22 20:03:45,895 INFO L137 Inliner]: procedures = 775, calls = 2445, calls flagged for inlining = 755, calls inlined = 71, statements flattened = 1167 [2021-11-22 20:03:45,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:03:45,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:03:45,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:03:45,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:03:45,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45" (1/1) ... [2021-11-22 20:03:45,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45" (1/1) ... [2021-11-22 20:03:45,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45" (1/1) ... [2021-11-22 20:03:45,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45" (1/1) ... [2021-11-22 20:03:45,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45" (1/1) ... [2021-11-22 20:03:45,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45" (1/1) ... [2021-11-22 20:03:45,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45" (1/1) ... [2021-11-22 20:03:45,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:03:45,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:03:45,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:03:45,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:03:45,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45" (1/1) ... [2021-11-22 20:03:46,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:03:46,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:03:46,049 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-11-22 20:03:46,088 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-11-22 20:03:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-22 20:03:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 20:03:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:03:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:03:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:03:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:03:46,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:03:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:03:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:03:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 20:03:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:03:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:03:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 20:03:46,384 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:03:46,385 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:03:47,129 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 20:03:47,134 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 20:03:47,134 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-22 20:03:47,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:03:47 BoogieIcfgContainer [2021-11-22 20:03:47,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 20:03:47,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 20:03:47,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 20:03:47,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 20:03:47,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:03:43" (1/3) ... [2021-11-22 20:03:47,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70559796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:03:47, skipping insertion in model container [2021-11-22 20:03:47,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:45" (2/3) ... [2021-11-22 20:03:47,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70559796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:03:47, skipping insertion in model container [2021-11-22 20:03:47,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:03:47" (3/3) ... [2021-11-22 20:03:47,142 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clean_up_harness.i [2021-11-22 20:03:47,145 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 20:03:47,145 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-22 20:03:47,176 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 20:03:47,180 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-11-22 20:03:47,181 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-22 20:03:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 152 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-22 20:03:47,196 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:47,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:03:47,197 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash 937864719, now seen corresponding path program 1 times [2021-11-22 20:03:47,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:47,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321560532] [2021-11-22 20:03:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:47,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:47,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:47,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321560532] [2021-11-22 20:03:47,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321560532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:47,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:47,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 20:03:47,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246250832] [2021-11-22 20:03:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:47,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 20:03:47,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:47,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 20:03:47,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:03:47,617 INFO L87 Difference]: Start difference. First operand has 153 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 152 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:47,637 INFO L93 Difference]: Finished difference Result 302 states and 403 transitions. [2021-11-22 20:03:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 20:03:47,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-22 20:03:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:47,644 INFO L225 Difference]: With dead ends: 302 [2021-11-22 20:03:47,644 INFO L226 Difference]: Without dead ends: 146 [2021-11-22 20:03:47,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:03:47,649 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:47,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:03:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-22 20:03:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-11-22 20:03:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 140 states have (on average 1.2357142857142858) internal successors, (173), 145 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 173 transitions. [2021-11-22 20:03:47,684 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 173 transitions. Word has length 55 [2021-11-22 20:03:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:47,684 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 173 transitions. [2021-11-22 20:03:47,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 173 transitions. [2021-11-22 20:03:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-22 20:03:47,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:47,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:03:47,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 20:03:47,686 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:47,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1984182963, now seen corresponding path program 1 times [2021-11-22 20:03:47,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:47,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809398335] [2021-11-22 20:03:47,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:47,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:47,802 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:03:47,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880463114] [2021-11-22 20:03:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:47,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:03:47,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:03:47,815 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-11-22 20:03:47,817 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-11-22 20:03:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:48,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 2206 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 20:03:48,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:03:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:48,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:03:48,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:48,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809398335] [2021-11-22 20:03:48,388 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:03:48,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880463114] [2021-11-22 20:03:48,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880463114] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:48,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:48,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:03:48,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819773801] [2021-11-22 20:03:48,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:48,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:03:48,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:48,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:03:48,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:03:48,391 INFO L87 Difference]: Start difference. First operand 146 states and 173 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:48,429 INFO L93 Difference]: Finished difference Result 404 states and 480 transitions. [2021-11-22 20:03:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:03:48,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-22 20:03:48,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:48,431 INFO L225 Difference]: With dead ends: 404 [2021-11-22 20:03:48,432 INFO L226 Difference]: Without dead ends: 280 [2021-11-22 20:03:48,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:03:48,433 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 315 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:48,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 971 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:03:48,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-11-22 20:03:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 149. [2021-11-22 20:03:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 143 states have (on average 1.2307692307692308) internal successors, (176), 148 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 176 transitions. [2021-11-22 20:03:48,443 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 176 transitions. Word has length 55 [2021-11-22 20:03:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:48,443 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 176 transitions. [2021-11-22 20:03:48,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 176 transitions. [2021-11-22 20:03:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 20:03:48,444 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:48,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:03:48,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-22 20:03:48,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:03:48,664 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:48,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1945030449, now seen corresponding path program 1 times [2021-11-22 20:03:48,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:48,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148433788] [2021-11-22 20:03:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:48,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:48,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:48,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148433788] [2021-11-22 20:03:48,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148433788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:48,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:48,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:03:48,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209348263] [2021-11-22 20:03:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:48,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:03:48,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:48,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:03:48,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:03:48,893 INFO L87 Difference]: Start difference. First operand 149 states and 176 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:49,098 INFO L93 Difference]: Finished difference Result 266 states and 315 transitions. [2021-11-22 20:03:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:03:49,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-22 20:03:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:49,100 INFO L225 Difference]: With dead ends: 266 [2021-11-22 20:03:49,103 INFO L226 Difference]: Without dead ends: 155 [2021-11-22 20:03:49,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:03:49,106 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 226 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:49,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 702 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:03:49,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-22 20:03:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2021-11-22 20:03:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 150 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 178 transitions. [2021-11-22 20:03:49,129 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 178 transitions. Word has length 57 [2021-11-22 20:03:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:49,129 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 178 transitions. [2021-11-22 20:03:49,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 178 transitions. [2021-11-22 20:03:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 20:03:49,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:49,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:03:49,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 20:03:49,131 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1101024947, now seen corresponding path program 1 times [2021-11-22 20:03:49,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:49,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630244444] [2021-11-22 20:03:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:49,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:49,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:49,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630244444] [2021-11-22 20:03:49,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630244444] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:49,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:49,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:03:49,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930840830] [2021-11-22 20:03:49,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:49,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:03:49,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:49,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:03:49,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:03:49,328 INFO L87 Difference]: Start difference. First operand 151 states and 178 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:49,359 INFO L93 Difference]: Finished difference Result 265 states and 313 transitions. [2021-11-22 20:03:49,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:03:49,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-22 20:03:49,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:49,360 INFO L225 Difference]: With dead ends: 265 [2021-11-22 20:03:49,360 INFO L226 Difference]: Without dead ends: 149 [2021-11-22 20:03:49,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:03:49,361 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 149 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:49,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 309 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:03:49,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-11-22 20:03:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-11-22 20:03:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 148 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2021-11-22 20:03:49,368 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 57 [2021-11-22 20:03:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:49,368 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2021-11-22 20:03:49,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2021-11-22 20:03:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-22 20:03:49,369 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:49,369 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:03:49,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 20:03:49,370 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:49,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:49,370 INFO L85 PathProgramCache]: Analyzing trace with hash -2001667700, now seen corresponding path program 1 times [2021-11-22 20:03:49,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:49,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864392790] [2021-11-22 20:03:49,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:49,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:49,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:49,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864392790] [2021-11-22 20:03:49,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864392790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:49,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:49,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:03:49,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086425696] [2021-11-22 20:03:49,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:49,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:03:49,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:49,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:03:49,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:03:49,496 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:49,663 INFO L93 Difference]: Finished difference Result 264 states and 309 transitions. [2021-11-22 20:03:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 20:03:49,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-22 20:03:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:49,664 INFO L225 Difference]: With dead ends: 264 [2021-11-22 20:03:49,664 INFO L226 Difference]: Without dead ends: 152 [2021-11-22 20:03:49,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:03:49,665 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 160 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:49,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 392 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:03:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-22 20:03:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2021-11-22 20:03:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 143 states have (on average 1.1888111888111887) internal successors, (170), 148 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2021-11-22 20:03:49,672 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 59 [2021-11-22 20:03:49,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:49,672 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2021-11-22 20:03:49,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2021-11-22 20:03:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-22 20:03:49,673 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:49,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:03:49,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 20:03:49,674 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:49,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1973784707, now seen corresponding path program 1 times [2021-11-22 20:03:49,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:49,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697839139] [2021-11-22 20:03:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:49,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:49,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-11-22 20:03:49,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:49,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697839139] [2021-11-22 20:03:49,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697839139] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:49,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:49,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:03:49,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135729390] [2021-11-22 20:03:49,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:49,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:03:49,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:49,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:03:49,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:03:49,848 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:50,012 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2021-11-22 20:03:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:03:50,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-22 20:03:50,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:50,013 INFO L225 Difference]: With dead ends: 163 [2021-11-22 20:03:50,013 INFO L226 Difference]: Without dead ends: 159 [2021-11-22 20:03:50,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:03:50,014 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 193 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:50,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 519 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:03:50,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-22 20:03:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2021-11-22 20:03:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.177304964539007) internal successors, (166), 144 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2021-11-22 20:03:50,020 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 60 [2021-11-22 20:03:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:50,020 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2021-11-22 20:03:50,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2021-11-22 20:03:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-22 20:03:50,021 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:50,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:03:50,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 20:03:50,021 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 359931971, now seen corresponding path program 1 times [2021-11-22 20:03:50,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:50,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522259700] [2021-11-22 20:03:50,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:50,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:50,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:50,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522259700] [2021-11-22 20:03:50,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522259700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:50,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:50,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 20:03:50,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627441632] [2021-11-22 20:03:50,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:50,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 20:03:50,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:50,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 20:03:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:03:50,487 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:51,204 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2021-11-22 20:03:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 20:03:51,205 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-22 20:03:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:51,206 INFO L225 Difference]: With dead ends: 176 [2021-11-22 20:03:51,206 INFO L226 Difference]: Without dead ends: 166 [2021-11-22 20:03:51,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2021-11-22 20:03:51,207 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 554 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:51,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 1176 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 20:03:51,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-22 20:03:51,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 145. [2021-11-22 20:03:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.1702127659574468) internal successors, (165), 144 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2021-11-22 20:03:51,214 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 66 [2021-11-22 20:03:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:51,214 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2021-11-22 20:03:51,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,214 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2021-11-22 20:03:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 20:03:51,215 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:51,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:03:51,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 20:03:51,215 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:51,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1412068014, now seen corresponding path program 1 times [2021-11-22 20:03:51,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:51,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449971770] [2021-11-22 20:03:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:51,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:51,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:51,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449971770] [2021-11-22 20:03:51,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449971770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:51,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:51,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:03:51,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602201654] [2021-11-22 20:03:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:51,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:03:51,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:51,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:03:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:03:51,364 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:51,454 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2021-11-22 20:03:51,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:03:51,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-22 20:03:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:51,456 INFO L225 Difference]: With dead ends: 219 [2021-11-22 20:03:51,456 INFO L226 Difference]: Without dead ends: 145 [2021-11-22 20:03:51,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:03:51,457 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 25 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:51,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 522 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:03:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-22 20:03:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-11-22 20:03:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.1631205673758864) internal successors, (164), 144 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2021-11-22 20:03:51,463 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 71 [2021-11-22 20:03:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:51,463 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2021-11-22 20:03:51,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2021-11-22 20:03:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 20:03:51,464 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:51,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:03:51,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 20:03:51,465 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1566333128, now seen corresponding path program 1 times [2021-11-22 20:03:51,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:51,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173639809] [2021-11-22 20:03:51,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:51,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:51,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:51,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173639809] [2021-11-22 20:03:51,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173639809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:51,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:51,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:03:51,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357317763] [2021-11-22 20:03:51,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:51,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:03:51,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:51,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:03:51,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:03:51,593 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:51,745 INFO L93 Difference]: Finished difference Result 237 states and 270 transitions. [2021-11-22 20:03:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:03:51,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-22 20:03:51,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:51,746 INFO L225 Difference]: With dead ends: 237 [2021-11-22 20:03:51,746 INFO L226 Difference]: Without dead ends: 161 [2021-11-22 20:03:51,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:03:51,746 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 93 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:51,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 551 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:03:51,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-22 20:03:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 149. [2021-11-22 20:03:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 148 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 168 transitions. [2021-11-22 20:03:51,752 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 168 transitions. Word has length 76 [2021-11-22 20:03:51,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:51,753 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 168 transitions. [2021-11-22 20:03:51,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 168 transitions. [2021-11-22 20:03:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-22 20:03:51,753 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:51,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:03:51,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 20:03:51,753 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:51,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:51,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1250222456, now seen corresponding path program 1 times [2021-11-22 20:03:51,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:51,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291031626] [2021-11-22 20:03:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:51,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:51,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:51,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291031626] [2021-11-22 20:03:51,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291031626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:51,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:51,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:03:51,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849835595] [2021-11-22 20:03:51,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:51,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:03:51,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:51,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:03:51,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:03:51,898 INFO L87 Difference]: Start difference. First operand 149 states and 168 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:51,954 INFO L93 Difference]: Finished difference Result 228 states and 257 transitions. [2021-11-22 20:03:51,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:03:51,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-22 20:03:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:51,956 INFO L225 Difference]: With dead ends: 228 [2021-11-22 20:03:51,956 INFO L226 Difference]: Without dead ends: 145 [2021-11-22 20:03:51,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:03:51,958 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 500 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:51,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 329 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:03:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-22 20:03:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-11-22 20:03:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.1347517730496455) internal successors, (160), 144 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 160 transitions. [2021-11-22 20:03:51,965 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 160 transitions. Word has length 76 [2021-11-22 20:03:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:51,965 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 160 transitions. [2021-11-22 20:03:51,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2021-11-22 20:03:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 20:03:51,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:51,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:03:51,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 20:03:51,966 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:51,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash -571224543, now seen corresponding path program 1 times [2021-11-22 20:03:51,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:51,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017196015] [2021-11-22 20:03:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:51,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:52,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:52,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017196015] [2021-11-22 20:03:52,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017196015] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:52,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:52,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 20:03:52,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370962986] [2021-11-22 20:03:52,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:52,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:03:52,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:52,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:03:52,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:03:52,086 INFO L87 Difference]: Start difference. First operand 145 states and 160 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:52,096 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2021-11-22 20:03:52,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:03:52,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-22 20:03:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:52,097 INFO L225 Difference]: With dead ends: 193 [2021-11-22 20:03:52,097 INFO L226 Difference]: Without dead ends: 146 [2021-11-22 20:03:52,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:03:52,098 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:52,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:03:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-22 20:03:52,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-11-22 20:03:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 145 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2021-11-22 20:03:52,104 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 82 [2021-11-22 20:03:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:52,105 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2021-11-22 20:03:52,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2021-11-22 20:03:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 20:03:52,105 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:52,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:03:52,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 20:03:52,106 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:52,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:52,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1203782819, now seen corresponding path program 1 times [2021-11-22 20:03:52,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:52,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956764078] [2021-11-22 20:03:52,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:52,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:52,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:52,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956764078] [2021-11-22 20:03:52,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956764078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:52,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:52,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:03:52,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288816786] [2021-11-22 20:03:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:52,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:03:52,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:52,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:03:52,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:03:52,275 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:52,296 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2021-11-22 20:03:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:03:52,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-22 20:03:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:52,297 INFO L225 Difference]: With dead ends: 146 [2021-11-22 20:03:52,297 INFO L226 Difference]: Without dead ends: 144 [2021-11-22 20:03:52,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:03:52,298 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 49 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:52,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 399 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:03:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-22 20:03:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-11-22 20:03:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 1.127659574468085) internal successors, (159), 143 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2021-11-22 20:03:52,305 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 82 [2021-11-22 20:03:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:52,305 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2021-11-22 20:03:52,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2021-11-22 20:03:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-22 20:03:52,306 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:52,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:03:52,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 20:03:52,306 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:52,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1489220549, now seen corresponding path program 1 times [2021-11-22 20:03:52,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:52,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379118425] [2021-11-22 20:03:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:52,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:03:52,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:52,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379118425] [2021-11-22 20:03:52,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379118425] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:03:52,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:52,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:03:52,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89328401] [2021-11-22 20:03:52,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:03:52,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:03:52,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:03:52,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:03:52,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:03:52,729 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:03:52,772 INFO L93 Difference]: Finished difference Result 263 states and 289 transitions. [2021-11-22 20:03:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:03:52,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-22 20:03:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:03:52,773 INFO L225 Difference]: With dead ends: 263 [2021-11-22 20:03:52,773 INFO L226 Difference]: Without dead ends: 144 [2021-11-22 20:03:52,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:03:52,774 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:03:52,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 429 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:03:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-22 20:03:52,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2021-11-22 20:03:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 138 states have (on average 1.1159420289855073) internal successors, (154), 140 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2021-11-22 20:03:52,780 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 84 [2021-11-22 20:03:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:03:52,780 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2021-11-22 20:03:52,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:03:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2021-11-22 20:03:52,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 20:03:52,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:03:52,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:03:52,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 20:03:52,782 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:03:52,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:03:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1709760616, now seen corresponding path program 1 times [2021-11-22 20:03:52,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:03:52,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49189729] [2021-11-22 20:03:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:52,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:03:52,816 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:03:52,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207927692] [2021-11-22 20:03:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:03:52,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:03:52,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:03:52,818 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-11-22 20:03:52,844 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-11-22 20:03:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:03:53,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 2540 conjuncts, 149 conjunts are in the unsatisfiable core [2021-11-22 20:03:53,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:03:53,401 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-11-22 20:03:53,525 INFO L354 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2021-11-22 20:03:53,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2021-11-22 20:03:53,709 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-22 20:03:53,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-11-22 20:03:53,861 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-11-22 20:03:53,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 30 [2021-11-22 20:03:53,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:03:53,995 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:03:53,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2021-11-22 20:03:54,047 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 39 treesize of output 35 [2021-11-22 20:03:54,055 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-22 20:03:54,056 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 36 treesize of output 36 [2021-11-22 20:03:54,070 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-11-22 20:03:54,294 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:03:54,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-11-22 20:03:54,298 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 18 treesize of output 17 [2021-11-22 20:03:54,390 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:03:54,391 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 42 [2021-11-22 20:03:54,401 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-22 20:03:54,401 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 33 treesize of output 31 [2021-11-22 20:03:54,480 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:03:54,480 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-11-22 20:03:54,497 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:03:54,497 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2021-11-22 20:03:54,514 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-11-22 20:03:54,514 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 3 case distinctions, treesize of input 64 treesize of output 61 [2021-11-22 20:03:54,634 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:03:54,634 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 52 treesize of output 50 [2021-11-22 20:03:54,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:03:54,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49189729] [2021-11-22 20:03:54,638 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:03:54,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207927692] [2021-11-22 20:03:54,638 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unexpected substitution problem. [2021-11-22 20:03:54,638 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:03:54,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-22 20:03:54,639 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-22 20:03:54,639 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-22 20:03:54,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-22 20:03:54,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-22 20:03:54,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2021-11-22 20:03:54,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2021-11-22 20:03:54,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2021-11-22 20:03:54,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-22 20:03:54,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-22 20:03:54,859 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,SelfDestructingSolverStorable13 [2021-11-22 20:03:54,862 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:03:54,864 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 20:03:54,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 08:03:54 BoogieIcfgContainer [2021-11-22 20:03:54,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 20:03:54,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 20:03:54,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 20:03:54,894 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 20:03:54,894 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:03:47" (3/4) ... [2021-11-22 20:03:54,899 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-22 20:03:54,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 20:03:54,899 INFO L158 Benchmark]: Toolchain (without parser) took 11246.33ms. Allocated memory was 107.0MB in the beginning and 396.4MB in the end (delta: 289.4MB). Free memory was 71.0MB in the beginning and 137.2MB in the end (delta: -66.3MB). Peak memory consumption was 223.9MB. Max. memory is 16.1GB. [2021-11-22 20:03:54,899 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory was 65.2MB in the beginning and 65.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 20:03:54,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2046.32ms. Allocated memory was 107.0MB in the beginning and 148.9MB in the end (delta: 41.9MB). Free memory was 70.7MB in the beginning and 64.1MB in the end (delta: 6.6MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2021-11-22 20:03:54,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 195.16ms. Allocated memory is still 148.9MB. Free memory was 64.1MB in the beginning and 50.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-22 20:03:54,900 INFO L158 Benchmark]: Boogie Preprocessor took 99.14ms. Allocated memory was 148.9MB in the beginning and 241.2MB in the end (delta: 92.3MB). Free memory was 50.3MB in the beginning and 178.9MB in the end (delta: -128.7MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2021-11-22 20:03:54,900 INFO L158 Benchmark]: RCFGBuilder took 1139.12ms. Allocated memory is still 241.2MB. Free memory was 178.9MB in the beginning and 151.4MB in the end (delta: 27.5MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2021-11-22 20:03:54,900 INFO L158 Benchmark]: TraceAbstraction took 7756.23ms. Allocated memory was 241.2MB in the beginning and 396.4MB in the end (delta: 155.2MB). Free memory was 150.0MB in the beginning and 137.2MB in the end (delta: 12.8MB). Peak memory consumption was 168.3MB. Max. memory is 16.1GB. [2021-11-22 20:03:54,901 INFO L158 Benchmark]: Witness Printer took 5.16ms. Allocated memory is still 396.4MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 20:03:54,902 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.17ms. Allocated memory is still 107.0MB. Free memory was 65.2MB in the beginning and 65.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2046.32ms. Allocated memory was 107.0MB in the beginning and 148.9MB in the end (delta: 41.9MB). Free memory was 70.7MB in the beginning and 64.1MB in the end (delta: 6.6MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 195.16ms. Allocated memory is still 148.9MB. Free memory was 64.1MB in the beginning and 50.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.14ms. Allocated memory was 148.9MB in the beginning and 241.2MB in the end (delta: 92.3MB). Free memory was 50.3MB in the beginning and 178.9MB in the end (delta: -128.7MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1139.12ms. Allocated memory is still 241.2MB. Free memory was 178.9MB in the beginning and 151.4MB in the end (delta: 27.5MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7756.23ms. Allocated memory was 241.2MB in the beginning and 396.4MB in the end (delta: 155.2MB). Free memory was 150.0MB in the beginning and 137.2MB in the end (delta: 12.8MB). Peak memory consumption was 168.3MB. Max. memory is 16.1GB. * Witness Printer took 5.16ms. Allocated memory is still 396.4MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 7602, overapproximation of __builtin_uaddl_overflow at line 250, overapproximation of bitwiseAnd at line 7402, overapproximation of __builtin_umull_overflow at line 255, overapproximation of someBinaryDOUBLEComparisonOperation at line 10066. Possible FailurePath: [L6927-L6932] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7379] static __thread int tl_last_error = 0; [L7601-L7749] static struct aws_error_info errors[] = { [(AWS_ERROR_SUCCESS)-0x0000] = { .literal_name = "AWS_ERROR_SUCCESS", .error_code = (AWS_ERROR_SUCCESS), .error_str = ("Success."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SUCCESS" ", " "Success.", } , [(AWS_ERROR_OOM)-0x0000] = { .literal_name = "AWS_ERROR_OOM", .error_code = (AWS_ERROR_OOM), .error_str = ("Out of memory."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OOM" ", " "Out of memory.", } , [(AWS_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_UNKNOWN", .error_code = (AWS_ERROR_UNKNOWN), .error_str = ("Unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNKNOWN" ", " "Unknown error.", } , [(AWS_ERROR_SHORT_BUFFER)-0x0000] = { .literal_name = "AWS_ERROR_SHORT_BUFFER", .error_code = (AWS_ERROR_SHORT_BUFFER), .error_str = ("Buffer is not large enough to hold result."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SHORT_BUFFER" ", " "Buffer is not large enough to hold result.", } , [(AWS_ERROR_OVERFLOW_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_OVERFLOW_DETECTED", .error_code = (AWS_ERROR_OVERFLOW_DETECTED), .error_str = ("Fixed size value overflow was detected."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OVERFLOW_DETECTED" ", " "Fixed size value overflow was detected.", } , [(AWS_ERROR_UNSUPPORTED_OPERATION)-0x0000] = { .literal_name = "AWS_ERROR_UNSUPPORTED_OPERATION", .error_code = (AWS_ERROR_UNSUPPORTED_OPERATION), .error_str = ("Unsupported operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNSUPPORTED_OPERATION" ", " "Unsupported operation.", } , [(AWS_ERROR_INVALID_BUFFER_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BUFFER_SIZE", .error_code = (AWS_ERROR_INVALID_BUFFER_SIZE), .error_str = ("Invalid buffer size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BUFFER_SIZE" ", " "Invalid buffer size.", } , [(AWS_ERROR_INVALID_HEX_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_HEX_STR", .error_code = (AWS_ERROR_INVALID_HEX_STR), .error_str = ("Invalid hex string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_HEX_STR" ", " "Invalid hex string.", } , [(AWS_ERROR_INVALID_BASE64_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BASE64_STR", .error_code = (AWS_ERROR_INVALID_BASE64_STR), .error_str = ("Invalid base64 string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BASE64_STR" ", " "Invalid base64 string.", } , [(AWS_ERROR_INVALID_INDEX)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_INDEX", .error_code = (AWS_ERROR_INVALID_INDEX), .error_str = ("Invalid index for list access."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_INDEX" ", " "Invalid index for list access.", } , [(AWS_ERROR_THREAD_INVALID_SETTINGS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INVALID_SETTINGS", .error_code = (AWS_ERROR_THREAD_INVALID_SETTINGS), .error_str = ("Invalid thread settings."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INVALID_SETTINGS" ", " "Invalid thread settings.", } , [(AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE", .error_code = (AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE), .error_str = ("Insufficent resources for thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE" ", " "Insufficent resources for thread.", } , [(AWS_ERROR_THREAD_NO_PERMISSIONS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_PERMISSIONS", .error_code = (AWS_ERROR_THREAD_NO_PERMISSIONS), .error_str = ("Insufficient permissions for thread operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_PERMISSIONS" ", " "Insufficient permissions for thread operation.", } , [(AWS_ERROR_THREAD_NOT_JOINABLE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NOT_JOINABLE", .error_code = (AWS_ERROR_THREAD_NOT_JOINABLE), .error_str = ("Thread not joinable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NOT_JOINABLE" ", " "Thread not joinable.", } , [(AWS_ERROR_THREAD_NO_SUCH_THREAD_ID)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID", .error_code = (AWS_ERROR_THREAD_NO_SUCH_THREAD_ID), .error_str = ("No such thread ID."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID" ", " "No such thread ID.", } , [(AWS_ERROR_THREAD_DEADLOCK_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_DEADLOCK_DETECTED", .error_code = (AWS_ERROR_THREAD_DEADLOCK_DETECTED), .error_str = ("Deadlock detected in thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_DEADLOCK_DETECTED" ", " "Deadlock detected in thread.", } , [(AWS_ERROR_MUTEX_NOT_INIT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_NOT_INIT", .error_code = (AWS_ERROR_MUTEX_NOT_INIT), .error_str = ("Mutex not initialized."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_NOT_INIT" ", " "Mutex not initialized.", } , [(AWS_ERROR_MUTEX_TIMEOUT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_TIMEOUT", .error_code = (AWS_ERROR_MUTEX_TIMEOUT), .error_str = ("Mutex operation timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_TIMEOUT" ", " "Mutex operation timed out.", } , [(AWS_ERROR_MUTEX_CALLER_NOT_OWNER)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_CALLER_NOT_OWNER", .error_code = (AWS_ERROR_MUTEX_CALLER_NOT_OWNER), .error_str = ("The caller of a mutex operation was not the owner."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_CALLER_NOT_OWNER" ", " "The caller of a mutex operation was not the owner.", } , [(AWS_ERROR_MUTEX_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_FAILED", .error_code = (AWS_ERROR_MUTEX_FAILED), .error_str = ("Mutex operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_FAILED" ", " "Mutex operation failed.", } , [(AWS_ERROR_COND_VARIABLE_INIT_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_INIT_FAILED", .error_code = (AWS_ERROR_COND_VARIABLE_INIT_FAILED), .error_str = ("Condition variable initialization failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_INIT_FAILED" ", " "Condition variable initialization failed.", } , [(AWS_ERROR_COND_VARIABLE_TIMED_OUT)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_TIMED_OUT", .error_code = (AWS_ERROR_COND_VARIABLE_TIMED_OUT), .error_str = ("Condition variable wait timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_TIMED_OUT" ", " "Condition variable wait timed out.", } , [(AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN", .error_code = (AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN), .error_str = ("Condition variable unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN" ", " "Condition variable unknown error.", } , [(AWS_ERROR_CLOCK_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_CLOCK_FAILURE", .error_code = (AWS_ERROR_CLOCK_FAILURE), .error_str = ("Clock operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_CLOCK_FAILURE" ", " "Clock operation failed.", } , [(AWS_ERROR_LIST_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EMPTY", .error_code = (AWS_ERROR_LIST_EMPTY), .error_str = ("Empty list."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EMPTY" ", " "Empty list.", } , [(AWS_ERROR_DEST_COPY_TOO_SMALL)-0x0000] = { .literal_name = "AWS_ERROR_DEST_COPY_TOO_SMALL", .error_code = (AWS_ERROR_DEST_COPY_TOO_SMALL), .error_str = ("Destination of copy is too small."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_DEST_COPY_TOO_SMALL" ", " "Destination of copy is too small.", } , [(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE", .error_code = (AWS_ERROR_LIST_EXCEEDS_MAX_SIZE), .error_str = ("A requested operation on a list would exceed it's max size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE" ", " "A requested operation on a list would exceed it's max size.", } , [(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK)-0x0000] = { .literal_name = "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK", .error_code = (AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK), .error_str = ("Attempt to shrink a list in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK" ", " "Attempt to shrink a list in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_FULL)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_FULL", .error_code = (AWS_ERROR_PRIORITY_QUEUE_FULL), .error_str = ("Attempt to add items to a full preallocated queue in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_FULL" ", " "Attempt to add items to a full preallocated queue in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_EMPTY", .error_code = (AWS_ERROR_PRIORITY_QUEUE_EMPTY), .error_str = ("Attempt to pop an item from an empty queue."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_EMPTY" ", " "Attempt to pop an item from an empty queue.", } , [(AWS_ERROR_PRIORITY_QUEUE_BAD_NODE)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE", .error_code = (AWS_ERROR_PRIORITY_QUEUE_BAD_NODE), .error_str = ("Bad node handle passed to remove."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE" ", " "Bad node handle passed to remove.", } , [(AWS_ERROR_HASHTBL_ITEM_NOT_FOUND)-0x0000] = { .literal_name = "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND", .error_code = (AWS_ERROR_HASHTBL_ITEM_NOT_FOUND), .error_str = ("Item not found in hash table."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND" ", " "Item not found in hash table.", } , [(AWS_ERROR_INVALID_DATE_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_DATE_STR", .error_code = (AWS_ERROR_INVALID_DATE_STR), .error_str = ("Date string is invalid and cannot be parsed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_DATE_STR" ", " "Date string is invalid and cannot be parsed.", } , [(AWS_ERROR_INVALID_ARGUMENT)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_ARGUMENT", .error_code = (AWS_ERROR_INVALID_ARGUMENT), .error_str = ("An invalid argument was passed to a function."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_ARGUMENT" ", " "An invalid argument was passed to a function.", } , [(AWS_ERROR_RANDOM_GEN_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_RANDOM_GEN_FAILED", .error_code = (AWS_ERROR_RANDOM_GEN_FAILED), .error_str = ("A call to the random number generator failed. Retry later."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_RANDOM_GEN_FAILED" ", " "A call to the random number generator failed. Retry later.", } , [(AWS_ERROR_MALFORMED_INPUT_STRING)-0x0000] = { .literal_name = "AWS_ERROR_MALFORMED_INPUT_STRING", .error_code = (AWS_ERROR_MALFORMED_INPUT_STRING), .error_str = ("An input string was passed to a parser and the string was incorrectly formatted."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MALFORMED_INPUT_STRING" ", " "An input string was passed to a parser and the string was incorrectly formatted.", } , [(AWS_ERROR_UNIMPLEMENTED)-0x0000] = { .literal_name = "AWS_ERROR_UNIMPLEMENTED", .error_code = (AWS_ERROR_UNIMPLEMENTED), .error_str = ("A function was called, but is not implemented."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNIMPLEMENTED" ", " "A function was called, but is not implemented.", } , [(AWS_ERROR_INVALID_STATE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_STATE", .error_code = (AWS_ERROR_INVALID_STATE), .error_str = ("An invalid state was encountered."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_STATE" ", " "An invalid state was encountered.", } , [(AWS_ERROR_ENVIRONMENT_GET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_GET", .error_code = (AWS_ERROR_ENVIRONMENT_GET), .error_str = ("System call failure when getting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_GET" ", " "System call failure when getting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_SET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_SET", .error_code = (AWS_ERROR_ENVIRONMENT_SET), .error_str = ("System call failure when setting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_SET" ", " "System call failure when setting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_UNSET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_UNSET", .error_code = (AWS_ERROR_ENVIRONMENT_UNSET), .error_str = ("System call failure when unsetting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_UNSET" ", " "System call failure when unsetting an environment variable.", } , [(AWS_ERROR_SYS_CALL_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_SYS_CALL_FAILURE", .error_code = (AWS_ERROR_SYS_CALL_FAILURE), .error_str = ("System call failure"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SYS_CALL_FAILURE" ", " "System call failure", } , [(AWS_ERROR_FILE_INVALID_PATH)-0x0000] = { .literal_name = "AWS_ERROR_FILE_INVALID_PATH", .error_code = (AWS_ERROR_FILE_INVALID_PATH), .error_str = ("Invalid file path."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_FILE_INVALID_PATH" ", " "Invalid file path.", } , [(AWS_ERROR_MAX_FDS_EXCEEDED)-0x0000] = { .literal_name = "AWS_ERROR_MAX_FDS_EXCEEDED", .error_code = (AWS_ERROR_MAX_FDS_EXCEEDED), .error_str = ("The maximum number of fds has been exceeded."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MAX_FDS_EXCEEDED" ", " "The maximum number of fds has been exceeded.", } , [(AWS_ERROR_NO_PERMISSION)-0x0000] = { .literal_name = "AWS_ERROR_NO_PERMISSION", .error_code = (AWS_ERROR_NO_PERMISSION), .error_str = ("User does not have permission to perform the requested action."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_NO_PERMISSION" ", " "User does not have permission to perform the requested action.", } , [(AWS_ERROR_STREAM_UNSEEKABLE)-0x0000] = { .literal_name = "AWS_ERROR_STREAM_UNSEEKABLE", .error_code = (AWS_ERROR_STREAM_UNSEEKABLE), .error_str = ("Stream does not support seek operations"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_STREAM_UNSEEKABLE" ", " "Stream does not support seek operations", } , }; [L7752-L7755] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7757-L7766] static struct aws_log_subject_info s_common_log_subject_infos[] = { { .subject_id = (AWS_LS_COMMON_GENERAL), .subject_name = ("aws-c-common"), .subject_description = ("Subject for aws-c-common logging that doesn't belong to any particular category") } , { .subject_id = (AWS_LS_COMMON_TASK_SCHEDULER), .subject_name = ("task-scheduler"), .subject_description = ("Subject for task scheduler or task specific logging.") } , }; [L7768-L7771] static struct aws_log_subject_info_list s_common_log_subject_list = { .subject_list = s_common_log_subject_infos, .count = (sizeof(s_common_log_subject_infos) / sizeof((s_common_log_subject_infos)[0])), }; [L7773-L7777] static _Bool s_common_library_initialized = 0 ; [L10161] CALL aws_hash_table_clean_up_harness() [L10143] struct aws_hash_table map; [L10144] CALL ensure_allocated_hash_table(&map, 8) [L6810] CALL, EXPR nondet_uint64_t() [L266] return __VERIFIER_nondet_ulong(); [L6810] RET, EXPR nondet_uint64_t() [L6810] size_t num_entries = nondet_uint64_t(); [L6811] CALL assume_abort_if_not(num_entries <= max_table_entries) [L211] COND FALSE !(!cond) [L6811] RET assume_abort_if_not(num_entries <= max_table_entries) [L6812] CALL, EXPR aws_is_power_of_two(num_entries) [L2630] return x && (!(x & (x - 1))); [L6812] RET, EXPR aws_is_power_of_two(num_entries) [L6812] CALL assume_abort_if_not(aws_is_power_of_two(num_entries)) [L211] COND FALSE !(!cond) [L6812] RET assume_abort_if_not(aws_is_power_of_two(num_entries)) [L6814] size_t required_bytes; [L6815] CALL, EXPR hash_table_state_required_bytes(num_entries, &required_bytes) [L10130] size_t elemsize; [L10131] CALL aws_mul_size_checked(size, sizeof(struct hash_table_entry), &elemsize) [L2590] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2498] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] RET __CPROVER_overflow_mult(a, b) [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L10131] RET aws_mul_size_checked(size, sizeof(struct hash_table_entry), &elemsize) [L10131] COND FALSE !(aws_mul_size_checked(size, sizeof(struct hash_table_entry), &elemsize)) [L10135] EXPR \read(elemsize) [L10135] CALL aws_add_size_checked(elemsize, sizeof(struct hash_table_state), required_bytes) [L2617] CALL, EXPR aws_add_u64_checked(a, b, (uint64_t *)r) [L2542] CALL __CPROVER_overflow_plus(a, b) [L249] unsigned long c; [L250] return __builtin_uaddl_overflow(a, b, &c); [L250] return __builtin_uaddl_overflow(a, b, &c); [L2542] RET __CPROVER_overflow_plus(a, b) [L2542] COND FALSE !(__CPROVER_overflow_plus(a, b)) [L2544] *r = a + b [L2545] return (0); [L2617] RET, EXPR aws_add_u64_checked(a, b, (uint64_t *)r) [L2617] return aws_add_u64_checked(a, b, (uint64_t *)r); [L10135] RET aws_add_size_checked(elemsize, sizeof(struct hash_table_state), required_bytes) [L10135] COND FALSE !(aws_add_size_checked(elemsize, sizeof(struct hash_table_state), required_bytes)) [L10139] return (0); [L10139] return (0); [L6815] RET, EXPR hash_table_state_required_bytes(num_entries, &required_bytes) [L6815] CALL assume_abort_if_not(!hash_table_state_required_bytes(num_entries, &required_bytes)) [L211] COND FALSE !(!cond) [L6815] RET assume_abort_if_not(!hash_table_state_required_bytes(num_entries, &required_bytes)) [L6816] EXPR \read(required_bytes) [L6816] CALL, EXPR bounded_malloc(required_bytes) [L6944-L6946] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L211] COND FALSE !(!cond) [L6944-L6946] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L6947] return malloc(size); [L6816] RET, EXPR bounded_malloc(required_bytes) [L6816] struct hash_table_state *impl = bounded_malloc(required_bytes); [L6817] impl->size = num_entries [L6818] map->p_impl = impl [L10144] RET ensure_allocated_hash_table(&map, 8) [L10145] CALL, EXPR aws_hash_table_is_valid(&map) [L10017] EXPR map && map->p_impl [L10017] EXPR map->p_impl [L10017] EXPR map && map->p_impl [L10017] EXPR map && map->p_impl && hash_table_state_is_valid(map->p_impl) [L10017] EXPR map->p_impl [L10017] CALL, EXPR hash_table_state_is_valid(map->p_impl) [L10028] COND FALSE !(!map) [L10035] EXPR map->hash_fn [L10034-L10037] _Bool hash_fn_nonnull = (map->hash_fn != ((void *)0) ); [L10040] EXPR map->equals_fn [L10039-L10042] _Bool equals_fn_nonnull = (map->equals_fn != ((void *)0) ); [L10046] EXPR map->alloc [L10045-L10048] _Bool alloc_nonnull = (map->alloc != ((void *)0) ); [L10051] EXPR map->size [L10050-L10051] _Bool size_at_least_two = (map->size >= 2); [L10054] EXPR map->size [L10054] CALL, EXPR aws_is_power_of_two(map->size) [L2630] return x && (!(x & (x - 1))); [L10054] RET, EXPR aws_is_power_of_two(map->size) [L10053-L10054] _Bool size_is_power_of_two = aws_is_power_of_two(map->size); [L10057] EXPR map->entry_count [L10057] EXPR map->max_load [L10056-L10057] _Bool entry_count = (map->entry_count <= map->max_load); [L10060] EXPR map->max_load [L10060] EXPR map->size [L10059-L10060] _Bool max_load = (map->max_load < map->size); [L10063] EXPR map->mask [L10063] EXPR map->size [L10062-L10063] _Bool mask_is_correct = (map->mask == (map->size - 1)); [L10066] EXPR map->max_load_factor [L10065-L10066] _Bool max_load_factor_bounded = map->max_load_factor == 0.95; [L10069] EXPR map->size [L10068-L10069] _Bool slots_allocated = ((((sizeof(map->slots[0]) * map->size)) == 0) || ((&map->slots[0]))); [L10071-L10072] return hash_fn_nonnull && equals_fn_nonnull && alloc_nonnull && size_at_least_two && size_is_power_of_two && entry_count && max_load && mask_is_correct && max_load_factor_bounded && slots_allocated; [L10017] RET, EXPR hash_table_state_is_valid(map->p_impl) [L10017] EXPR map && map->p_impl && hash_table_state_is_valid(map->p_impl) [L10017] return map && map->p_impl && hash_table_state_is_valid(map->p_impl); [L10145] RET, EXPR aws_hash_table_is_valid(&map) [L10145] CALL assume_abort_if_not(aws_hash_table_is_valid(&map)) [L211] COND FALSE !(!cond) [L10145] RET assume_abort_if_not(aws_hash_table_is_valid(&map)) [L10146] CALL ensure_hash_table_has_valid_destroy_functions(&map) [L6822] EXPR map->p_impl [L6822] CALL, EXPR nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L6822] RET, EXPR nondet_bool() [L6822-L6824] EXPR nondet_bool() ? ((void *)0) : hash_proof_destroy_noop [L6822-L6824] map->p_impl->destroy_key_fn = nondet_bool() ? ((void *)0) : hash_proof_destroy_noop [L6825] EXPR map->p_impl [L6825] CALL, EXPR nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L6825] RET, EXPR nondet_bool() [L6825-L6827] EXPR nondet_bool() ? ((void *)0) : hash_proof_destroy_noop [L6825-L6827] map->p_impl->destroy_value_fn = nondet_bool() ? ((void *)0) : hash_proof_destroy_noop [L10146] RET ensure_hash_table_has_valid_destroy_functions(&map) [L10147] EXPR map.p_impl [L10147] CALL, EXPR can_fail_allocator() [L6951] return &s_can_fail_allocator_static; [L10147] RET, EXPR can_fail_allocator() [L10147] map.p_impl->alloc = can_fail_allocator() [L10149] EXPR map.p_impl [L10149] struct hash_table_state *state = map.p_impl; [L10150] size_t empty_slot_idx; [L10151] EXPR state->size [L10151] size_t size_in_bytes = sizeof(struct hash_table_state) + sizeof(struct hash_table_entry) * state->size; [L10152] FCALL __CPROVER_allocated_memory((unsigned long)state, size_in_bytes) [L10154] CALL, EXPR aws_hash_table_has_an_empty_slot(&map, &empty_slot_idx) [L6833] EXPR map->p_impl [L6833] CALL, EXPR hash_table_state_has_an_empty_slot(map->p_impl, rval) [L6839] EXPR state->entry_count [L6839] CALL assume_abort_if_not(state->entry_count > 0) [L211] COND FALSE !(!cond) [L6839] RET assume_abort_if_not(state->entry_count > 0) [L6840] CALL, EXPR nondet_uint64_t() [L266] return __VERIFIER_nondet_ulong(); [L6840] RET, EXPR nondet_uint64_t() [L6840] size_t empty_slot_idx = nondet_uint64_t(); [L6841] EXPR state->size [L6841] CALL assume_abort_if_not(empty_slot_idx < state->size) [L211] COND FALSE !(!cond) [L6841] RET assume_abort_if_not(empty_slot_idx < state->size) [L6842] *rval = empty_slot_idx [L6843] EXPR state->slots[empty_slot_idx].hash_code [L6843] return state->slots[empty_slot_idx].hash_code == 0; [L6833] RET, EXPR hash_table_state_has_an_empty_slot(map->p_impl, rval) [L6833] return hash_table_state_has_an_empty_slot(map->p_impl, rval); [L10154] RET, EXPR aws_hash_table_has_an_empty_slot(&map, &empty_slot_idx) [L10154] CALL assume_abort_if_not(aws_hash_table_has_an_empty_slot(&map, &empty_slot_idx)) [L211] COND FALSE !(!cond) [L10154] RET assume_abort_if_not(aws_hash_table_has_an_empty_slot(&map, &empty_slot_idx)) [L10155] CALL aws_hash_table_clean_up(&map) [L9273-L9275] CALL assume_abort_if_not((map != ((void *)0) )) [L211] COND FALSE !(!cond) [L9273-L9275] RET assume_abort_if_not((map != ((void *)0) )) [L9276] EXPR map->p_impl [L9276-L9278] EXPR map->p_impl == ((void *)0) || aws_hash_table_is_valid(map) [L9278] CALL, EXPR aws_hash_table_is_valid(map) [L10017] EXPR map && map->p_impl [L10017] EXPR map->p_impl [L10017] EXPR map && map->p_impl [L10017] EXPR map && map->p_impl && hash_table_state_is_valid(map->p_impl) [L10017] EXPR map->p_impl [L10017] CALL, EXPR hash_table_state_is_valid(map->p_impl) [L10028] COND FALSE !(!map) [L10035] EXPR map->hash_fn [L10034-L10037] _Bool hash_fn_nonnull = (map->hash_fn != ((void *)0) ); [L10040] EXPR map->equals_fn [L10039-L10042] _Bool equals_fn_nonnull = (map->equals_fn != ((void *)0) ); [L10046] EXPR map->alloc [L10045-L10048] _Bool alloc_nonnull = (map->alloc != ((void *)0) ); [L10051] EXPR map->size [L10050-L10051] _Bool size_at_least_two = (map->size >= 2); [L10054] EXPR map->size [L10054] CALL, EXPR aws_is_power_of_two(map->size) [L2630] return x && (!(x & (x - 1))); [L10054] RET, EXPR aws_is_power_of_two(map->size) [L10053-L10054] _Bool size_is_power_of_two = aws_is_power_of_two(map->size); [L10057] EXPR map->entry_count [L10057] EXPR map->max_load [L10056-L10057] _Bool entry_count = (map->entry_count <= map->max_load); [L10060] EXPR map->max_load [L10060] EXPR map->size [L10059-L10060] _Bool max_load = (map->max_load < map->size); [L10063] EXPR map->mask [L10063] EXPR map->size [L10062-L10063] _Bool mask_is_correct = (map->mask == (map->size - 1)); [L10066] EXPR map->max_load_factor [L10065-L10066] _Bool max_load_factor_bounded = map->max_load_factor == 0.95; [L10069] EXPR map->size [L10068-L10069] _Bool slots_allocated = ((((sizeof(map->slots[0]) * map->size)) == 0) || ((&map->slots[0]))); [L10071-L10072] return hash_fn_nonnull && equals_fn_nonnull && alloc_nonnull && size_at_least_two && size_is_power_of_two && entry_count && max_load && mask_is_correct && max_load_factor_bounded && slots_allocated; [L10017] RET, EXPR hash_table_state_is_valid(map->p_impl) [L10017] EXPR map && map->p_impl && hash_table_state_is_valid(map->p_impl) [L10017] return map && map->p_impl && hash_table_state_is_valid(map->p_impl); [L9278] RET, EXPR aws_hash_table_is_valid(map) [L9276-L9278] EXPR map->p_impl == ((void *)0) || aws_hash_table_is_valid(map) [L9276-L9278] CALL assume_abort_if_not((map->p_impl == ((void *)0) || aws_hash_table_is_valid(map))) [L211] COND FALSE !(!cond) [L9276-L9278] RET assume_abort_if_not((map->p_impl == ((void *)0) || aws_hash_table_is_valid(map))) [L9282] EXPR map->p_impl [L9282] struct hash_table_state *state = map->p_impl; [L9285] COND FALSE !(!state) [L9289] CALL aws_hash_table_clear(map) [L9934] CALL, EXPR aws_hash_table_is_valid(map) [L10017] EXPR map && map->p_impl [L10017] EXPR map->p_impl [L10017] EXPR map && map->p_impl [L10017] EXPR map && map->p_impl && hash_table_state_is_valid(map->p_impl) [L10017] EXPR map->p_impl [L10017] CALL, EXPR hash_table_state_is_valid(map->p_impl) [L10028] COND FALSE !(!map) [L10035] EXPR map->hash_fn [L10034-L10037] _Bool hash_fn_nonnull = (map->hash_fn != ((void *)0) ); [L10040] EXPR map->equals_fn [L10039-L10042] _Bool equals_fn_nonnull = (map->equals_fn != ((void *)0) ); [L10046] EXPR map->alloc [L10045-L10048] _Bool alloc_nonnull = (map->alloc != ((void *)0) ); [L10051] EXPR map->size [L10050-L10051] _Bool size_at_least_two = (map->size >= 2); [L10054] EXPR map->size [L10054] CALL, EXPR aws_is_power_of_two(map->size) [L2630] return x && (!(x & (x - 1))); [L10054] RET, EXPR aws_is_power_of_two(map->size) [L10053-L10054] _Bool size_is_power_of_two = aws_is_power_of_two(map->size); [L10057] EXPR map->entry_count [L10057] EXPR map->max_load [L10056-L10057] _Bool entry_count = (map->entry_count <= map->max_load); [L10060] EXPR map->max_load [L10060] EXPR map->size [L10059-L10060] _Bool max_load = (map->max_load < map->size); [L10063] EXPR map->mask [L10063] EXPR map->size [L10062-L10063] _Bool mask_is_correct = (map->mask == (map->size - 1)); [L10066] EXPR map->max_load_factor [L10065-L10066] _Bool max_load_factor_bounded = map->max_load_factor == 0.95; [L10069] EXPR map->size [L10068-L10069] _Bool slots_allocated = ((((sizeof(map->slots[0]) * map->size)) == 0) || ((&map->slots[0]))); [L10071-L10072] return hash_fn_nonnull && equals_fn_nonnull && alloc_nonnull && size_at_least_two && size_is_power_of_two && entry_count && max_load && mask_is_correct && max_load_factor_bounded && slots_allocated; [L10017] RET, EXPR hash_table_state_is_valid(map->p_impl) [L10017] EXPR map && map->p_impl && hash_table_state_is_valid(map->p_impl) [L10017] return map && map->p_impl && hash_table_state_is_valid(map->p_impl); [L9934] RET, EXPR aws_hash_table_is_valid(map) [L9934] CALL assume_abort_if_not((aws_hash_table_is_valid(map))) [L211] COND FALSE !(!cond) [L9934] RET assume_abort_if_not((aws_hash_table_is_valid(map))) [L9935] EXPR map->p_impl [L9935] struct hash_table_state *state = map->p_impl; [L9938] EXPR state->destroy_key_fn [L9938] state->destroy_key_fn || state->destroy_value_fn [L9938] EXPR state->destroy_value_fn [L9938] state->destroy_key_fn || state->destroy_value_fn [L9938] COND FALSE !(state->destroy_key_fn || state->destroy_value_fn) [L9954] EXPR state->size [L9954] CALL my_memset(state->slots, 0, sizeof(*state->slots) * state->size) [L7415] CALL memset_override_0_impl(s, c, n) [L7398] CALL assume_abort_if_not((((n) == 0) || (dst))) [L211] COND FALSE !(!cond) [L7398] RET assume_abort_if_not((((n) == 0) || (dst))) [L7400] CALL __VERIFIER_assert(c == 0) [L223] COND FALSE !(!cond) [L7400] RET __VERIFIER_assert(c == 0) [L7401] size_t num_uint64s = n >> 3; [L7402] size_t rem = n & 0x7; [L7403] CALL __VERIFIER_assert(rem == 0) [L223] COND TRUE !cond [L223] reach_error() - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2265 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2265 mSDsluCounter, 6787 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4642 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1187 IncrementalHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 2145 mSDtfsCounter, 1187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 188 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 967 NumberOfCodeBlocks, 967 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 867 ConstructedInterpolants, 0 QuantifiedInterpolants, 2453 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4746 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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-11-22 20:03:54,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:03:56,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:03:56,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:03:56,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:03:56,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:03:56,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:03:56,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:03:56,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:03:56,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:03:56,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:03:56,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:03:56,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:03:56,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:03:56,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:03:56,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:03:56,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:03:56,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:03:56,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:03:56,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:03:56,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:03:56,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:03:56,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:03:56,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:03:56,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:03:56,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:03:56,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:03:56,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:03:56,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:03:56,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:03:56,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:03:56,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:03:56,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:03:56,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:03:56,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:03:56,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:03:56,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:03:56,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:03:56,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:03:56,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:03:56,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:03:56,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:03:56,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-22 20:03:56,765 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:03:56,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:03:56,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:03:56,767 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:03:56,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:03:56,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:03:56,768 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:03:56,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:03:56,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:03:56,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:03:56,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:03:56,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:03:56,769 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 20:03:56,770 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-22 20:03:56,770 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-22 20:03:56,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:03:56,770 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:03:56,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:03:56,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:03:56,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:03:56,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:03:56,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:03:56,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:03:56,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:03:56,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:03:56,771 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-22 20:03:56,772 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-22 20:03:56,772 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:03:56,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:03:56,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:03:56,772 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:03:56,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-22 20:03:56,781 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 ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 [2021-11-22 20:03:57,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:03:57,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:03:57,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:03:57,061 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:03:57,062 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:03:57,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2021-11-22 20:03:57,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc862063/b8b97a12c4ba4a29a9f4aafa3bd84663/FLAG1df006895 [2021-11-22 20:03:57,763 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:03:57,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2021-11-22 20:03:57,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc862063/b8b97a12c4ba4a29a9f4aafa3bd84663/FLAG1df006895 [2021-11-22 20:03:57,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc862063/b8b97a12c4ba4a29a9f4aafa3bd84663 [2021-11-22 20:03:57,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:03:57,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:03:57,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:03:57,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:03:57,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:03:57,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:03:57" (1/1) ... [2021-11-22 20:03:57,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b90f87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:03:57, skipping insertion in model container [2021-11-22 20:03:57,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:03:57" (1/1) ... [2021-11-22 20:03:57,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:03:58,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:03:58,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4497,4510] [2021-11-22 20:03:58,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4557,4570] [2021-11-22 20:03:58,754 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,755 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,755 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,756 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,757 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,764 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,765 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,766 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,766 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,767 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,768 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,775 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:58,775 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,007 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:03:59,008 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:03:59,009 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:03:59,010 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:03:59,011 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:03:59,011 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:03:59,012 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:03:59,012 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:03:59,013 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:03:59,013 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:03:59,116 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:03:59,340 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,341 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,352 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,353 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,356 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,356 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,379 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,380 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,381 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,381 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,381 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,382 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,382 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:03:59,446 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-22 20:03:59,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:03:59,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4497,4510] [2021-11-22 20:03:59,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4557,4570] [2021-11-22 20:03:59,514 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,515 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,515 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,515 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,515 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,520 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,520 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,521 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,521 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,522 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,522 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,523 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,523 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,553 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:03:59,554 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:03:59,554 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:03:59,555 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:03:59,555 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:03:59,556 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:03:59,556 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:03:59,556 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:03:59,556 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:03:59,557 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:03:59,578 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:03:59,660 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,660 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,664 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,665 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,666 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,667 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,670 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,671 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,671 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,671 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,672 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,672 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,672 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,683 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:03:59,706 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:03:59,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4497,4510] [2021-11-22 20:03:59,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4557,4570] [2021-11-22 20:03:59,756 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,756 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,756 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,756 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,757 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,760 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,761 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,761 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,762 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,763 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,763 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,764 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,764 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,779 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:03:59,780 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:03:59,781 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:03:59,781 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:03:59,781 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:03:59,782 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:03:59,782 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:03:59,782 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:03:59,783 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:03:59,783 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:03:59,794 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:03:59,906 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,918 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,939 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,940 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,945 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,946 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,951 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,953 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,953 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,953 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,954 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,954 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,954 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:03:59,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:04:00,274 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:04:00,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00 WrapperNode [2021-11-22 20:04:00,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:04:00,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:04:00,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:04:00,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:04:00,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00" (1/1) ... [2021-11-22 20:04:00,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00" (1/1) ... [2021-11-22 20:04:00,448 INFO L137 Inliner]: procedures = 795, calls = 2445, calls flagged for inlining = 755, calls inlined = 71, statements flattened = 1161 [2021-11-22 20:04:00,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:04:00,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:04:00,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:04:00,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:04:00,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00" (1/1) ... [2021-11-22 20:04:00,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00" (1/1) ... [2021-11-22 20:04:00,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00" (1/1) ... [2021-11-22 20:04:00,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00" (1/1) ... [2021-11-22 20:04:00,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00" (1/1) ... [2021-11-22 20:04:00,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00" (1/1) ... [2021-11-22 20:04:00,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00" (1/1) ... [2021-11-22 20:04:00,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:04:00,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:04:00,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:04:00,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:04:00,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00" (1/1) ... [2021-11-22 20:04:00,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:04:00,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:04:00,564 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-11-22 20:04:00,614 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-11-22 20:04:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2021-11-22 20:04:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:04:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:04:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:04:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:04:00,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:04:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:04:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:04:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:04:00,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-22 20:04:00,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-22 20:04:00,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-22 20:04:00,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-22 20:04:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-22 20:04:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:04:00,877 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:04:00,878 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:04:02,344 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 20:04:02,348 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 20:04:02,349 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-22 20:04:02,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:04:02 BoogieIcfgContainer [2021-11-22 20:04:02,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 20:04:02,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 20:04:02,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 20:04:02,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 20:04:02,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:03:57" (1/3) ... [2021-11-22 20:04:02,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c3f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:04:02, skipping insertion in model container [2021-11-22 20:04:02,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:00" (2/3) ... [2021-11-22 20:04:02,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c3f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:04:02, skipping insertion in model container [2021-11-22 20:04:02,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:04:02" (3/3) ... [2021-11-22 20:04:02,354 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clean_up_harness.i [2021-11-22 20:04:02,357 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 20:04:02,357 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-22 20:04:02,388 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 20:04:02,392 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-11-22 20:04:02,392 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-22 20:04:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 152 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-22 20:04:02,406 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:02,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:02,407 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:04:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 937864719, now seen corresponding path program 1 times [2021-11-22 20:04:02,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:04:02,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280883760] [2021-11-22 20:04:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:02,420 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:04:02,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:04:02,422 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-11-22 20:04:02,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-22 20:04:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:03,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-22 20:04:03,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:03,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:04:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:03,170 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:04:03,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280883760] [2021-11-22 20:04:03,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280883760] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:03,170 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:03,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-22 20:04:03,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048224483] [2021-11-22 20:04:03,172 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:03,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 20:04:03,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:04:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 20:04:03,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:04:03,192 INFO L87 Difference]: Start difference. First operand has 153 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 152 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:03,210 INFO L93 Difference]: Finished difference Result 302 states and 403 transitions. [2021-11-22 20:04:03,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 20:04:03,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-22 20:04:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:03,217 INFO L225 Difference]: With dead ends: 302 [2021-11-22 20:04:03,218 INFO L226 Difference]: Without dead ends: 146 [2021-11-22 20:04:03,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:04:03,222 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:03,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:04:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-22 20:04:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-11-22 20:04:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 140 states have (on average 1.2357142857142858) internal successors, (173), 145 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 173 transitions. [2021-11-22 20:04:03,248 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 173 transitions. Word has length 55 [2021-11-22 20:04:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:03,248 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 173 transitions. [2021-11-22 20:04:03,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 173 transitions. [2021-11-22 20:04:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-22 20:04:03,249 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:03,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:03,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-22 20:04:03,468 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-11-22 20:04:03,468 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:04:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1984182963, now seen corresponding path program 1 times [2021-11-22 20:04:03,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:04:03,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256751973] [2021-11-22 20:04:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:03,471 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:04:03,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:04:03,476 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-11-22 20:04:03,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-22 20:04:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:04,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 20:04:04,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:04,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:04:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:04,242 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:04:04,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256751973] [2021-11-22 20:04:04,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256751973] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:04,242 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:04,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-22 20:04:04,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630829455] [2021-11-22 20:04:04,243 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:04,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:04:04,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:04:04,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:04:04,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:04:04,245 INFO L87 Difference]: Start difference. First operand 146 states and 173 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:04,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:04,319 INFO L93 Difference]: Finished difference Result 404 states and 480 transitions. [2021-11-22 20:04:04,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:04:04,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-22 20:04:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:04,322 INFO L225 Difference]: With dead ends: 404 [2021-11-22 20:04:04,322 INFO L226 Difference]: Without dead ends: 280 [2021-11-22 20:04:04,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:04:04,323 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 315 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:04,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 971 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:04:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-11-22 20:04:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 149. [2021-11-22 20:04:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 143 states have (on average 1.2307692307692308) internal successors, (176), 148 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 176 transitions. [2021-11-22 20:04:04,332 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 176 transitions. Word has length 55 [2021-11-22 20:04:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:04,332 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 176 transitions. [2021-11-22 20:04:04,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 176 transitions. [2021-11-22 20:04:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 20:04:04,333 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:04,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:04,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-22 20:04:04,557 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-11-22 20:04:04,557 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:04:04,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:04,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1945030449, now seen corresponding path program 1 times [2021-11-22 20:04:04,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:04:04,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390405310] [2021-11-22 20:04:04,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:04,560 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:04:04,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:04:04,561 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-11-22 20:04:04,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-22 20:04:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:05,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 20:04:05,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:05,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:04:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:05,292 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:04:05,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390405310] [2021-11-22 20:04:05,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390405310] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:05,293 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:05,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-22 20:04:05,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993467090] [2021-11-22 20:04:05,293 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:05,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:04:05,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:04:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:04:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:04:05,294 INFO L87 Difference]: Start difference. First operand 149 states and 176 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:05,367 INFO L93 Difference]: Finished difference Result 273 states and 323 transitions. [2021-11-22 20:04:05,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:04:05,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-22 20:04:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:05,368 INFO L225 Difference]: With dead ends: 273 [2021-11-22 20:04:05,368 INFO L226 Difference]: Without dead ends: 149 [2021-11-22 20:04:05,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:04:05,369 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 2 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:05,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 483 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:04:05,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-11-22 20:04:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2021-11-22 20:04:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 140 states have (on average 1.2214285714285715) internal successors, (171), 145 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2021-11-22 20:04:05,375 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 57 [2021-11-22 20:04:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:05,376 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2021-11-22 20:04:05,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2021-11-22 20:04:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-22 20:04:05,377 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:05,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:05,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-22 20:04:05,597 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-11-22 20:04:05,597 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:04:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:05,598 INFO L85 PathProgramCache]: Analyzing trace with hash 737166142, now seen corresponding path program 1 times [2021-11-22 20:04:05,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:04:05,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318102426] [2021-11-22 20:04:05,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:05,599 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:04:05,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:04:05,601 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-11-22 20:04:05,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-22 20:04:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:06,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-22 20:04:06,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:06,527 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-11-22 20:04:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:06,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:04:06,680 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 26 [2021-11-22 20:04:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:06,797 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:04:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318102426] [2021-11-22 20:04:06,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318102426] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:06,798 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:06,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2021-11-22 20:04:06,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907540478] [2021-11-22 20:04:06,798 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:06,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:04:06,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:04:06,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:04:06,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:04:06,799 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:08,092 INFO L93 Difference]: Finished difference Result 263 states and 310 transitions. [2021-11-22 20:04:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:04:08,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-22 20:04:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:08,097 INFO L225 Difference]: With dead ends: 263 [2021-11-22 20:04:08,097 INFO L226 Difference]: Without dead ends: 152 [2021-11-22 20:04:08,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:04:08,098 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 368 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:08,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 689 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-22 20:04:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-22 20:04:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2021-11-22 20:04:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 147 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2021-11-22 20:04:08,111 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 60 [2021-11-22 20:04:08,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:08,111 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2021-11-22 20:04:08,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2021-11-22 20:04:08,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-22 20:04:08,112 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:08,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:08,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-22 20:04:08,327 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-11-22 20:04:08,327 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:04:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash -106839360, now seen corresponding path program 1 times [2021-11-22 20:04:08,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:04:08,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660766612] [2021-11-22 20:04:08,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:08,330 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:04:08,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:04:08,332 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-11-22 20:04:08,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-22 20:04:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:09,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 1406 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 20:04:09,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:09,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:04:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:09,315 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:04:09,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660766612] [2021-11-22 20:04:09,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660766612] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:09,315 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:09,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-22 20:04:09,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558195053] [2021-11-22 20:04:09,315 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:09,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:04:09,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:04:09,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:04:09,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:04:09,316 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:09,426 INFO L93 Difference]: Finished difference Result 262 states and 308 transitions. [2021-11-22 20:04:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:04:09,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-22 20:04:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:09,427 INFO L225 Difference]: With dead ends: 262 [2021-11-22 20:04:09,427 INFO L226 Difference]: Without dead ends: 146 [2021-11-22 20:04:09,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:04:09,428 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 144 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:09,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 306 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:04:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-22 20:04:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-11-22 20:04:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 140 states have (on average 1.207142857142857) internal successors, (169), 145 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2021-11-22 20:04:09,434 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 60 [2021-11-22 20:04:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:09,435 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2021-11-22 20:04:09,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2021-11-22 20:04:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 20:04:09,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:09,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:04:09,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-22 20:04:09,647 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-11-22 20:04:09,647 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:04:09,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:09,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1176870489, now seen corresponding path program 1 times [2021-11-22 20:04:09,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:04:09,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686677919] [2021-11-22 20:04:09,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:09,650 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:04:09,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:04:09,651 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-11-22 20:04:09,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-22 20:04:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:10,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-22 20:04:10,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:10,540 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-11-22 20:04:10,570 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-11-22 20:04:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:10,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:04:10,647 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 26 [2021-11-22 20:04:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:10,747 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:04:10,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686677919] [2021-11-22 20:04:10,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686677919] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:10,747 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:10,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-11-22 20:04:10,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395931949] [2021-11-22 20:04:10,747 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:10,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:04:10,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:04:10,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:04:10,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:04:10,748 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:11,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:11,898 INFO L93 Difference]: Finished difference Result 332 states and 387 transitions. [2021-11-22 20:04:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:04:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 20:04:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:11,900 INFO L225 Difference]: With dead ends: 332 [2021-11-22 20:04:11,900 INFO L226 Difference]: Without dead ends: 220 [2021-11-22 20:04:11,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:04:11,900 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 374 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:11,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 535 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-22 20:04:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-11-22 20:04:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 146. [2021-11-22 20:04:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 140 states have (on average 1.2) internal successors, (168), 145 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 168 transitions. [2021-11-22 20:04:11,912 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 168 transitions. Word has length 62 [2021-11-22 20:04:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:11,912 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 168 transitions. [2021-11-22 20:04:11,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2021-11-22 20:04:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 20:04:11,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:11,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:04:11,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-22 20:04:12,131 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-11-22 20:04:12,131 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:04:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2071618640, now seen corresponding path program 1 times [2021-11-22 20:04:12,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:04:12,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859809081] [2021-11-22 20:04:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:12,134 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:04:12,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:04:12,135 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-11-22 20:04:12,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-22 20:04:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:12,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-22 20:04:12,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:13,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:04:13,277 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-22 20:04:13,277 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 31 [2021-11-22 20:04:13,284 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-11-22 20:04:13,284 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 27 treesize of output 19 [2021-11-22 20:04:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:13,347 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:04:13,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859809081] [2021-11-22 20:04:13,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859809081] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:13,347 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:13,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-22 20:04:13,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193810912] [2021-11-22 20:04:13,347 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:13,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:04:13,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:04:13,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:04:13,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:04:13,349 INFO L87 Difference]: Start difference. First operand 146 states and 168 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:14,803 INFO L93 Difference]: Finished difference Result 201 states and 233 transitions. [2021-11-22 20:04:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:04:14,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-22 20:04:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:14,804 INFO L225 Difference]: With dead ends: 201 [2021-11-22 20:04:14,804 INFO L226 Difference]: Without dead ends: 197 [2021-11-22 20:04:14,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:04:14,805 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 275 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:14,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 770 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-22 20:04:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-22 20:04:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 150. [2021-11-22 20:04:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.193103448275862) internal successors, (173), 149 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2021-11-22 20:04:14,810 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 63 [2021-11-22 20:04:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:14,810 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2021-11-22 20:04:14,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2021-11-22 20:04:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-22 20:04:14,811 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:14,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:04:14,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-22 20:04:15,012 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-11-22 20:04:15,012 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:04:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:15,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1562855636, now seen corresponding path program 1 times [2021-11-22 20:04:15,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:04:15,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188148297] [2021-11-22 20:04:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:15,014 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:04:15,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:04:15,022 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-11-22 20:04:15,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-22 20:04:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:15,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-22 20:04:15,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:15,998 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 27 [2021-11-22 20:04:16,008 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 27 treesize of output 19 [2021-11-22 20:04:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:16,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:04:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:16,155 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:04:16,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188148297] [2021-11-22 20:04:16,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188148297] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:16,155 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:16,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2021-11-22 20:04:16,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851209987] [2021-11-22 20:04:16,155 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:16,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:04:16,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:04:16,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:04:16,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:04:16,156 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:17,355 INFO L93 Difference]: Finished difference Result 244 states and 282 transitions. [2021-11-22 20:04:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:04:17,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-11-22 20:04:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:17,357 INFO L225 Difference]: With dead ends: 244 [2021-11-22 20:04:17,357 INFO L226 Difference]: Without dead ends: 164 [2021-11-22 20:04:17,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:04:17,358 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 93 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:17,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 702 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-22 20:04:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-22 20:04:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2021-11-22 20:04:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.1904761904761905) internal successors, (175), 151 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2021-11-22 20:04:17,362 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 68 [2021-11-22 20:04:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:17,363 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2021-11-22 20:04:17,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2021-11-22 20:04:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-22 20:04:17,363 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:17,363 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:04:17,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-22 20:04:17,575 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-11-22 20:04:17,575 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:04:17,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1821021074, now seen corresponding path program 1 times [2021-11-22 20:04:17,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:04:17,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827095307] [2021-11-22 20:04:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:17,577 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:04:17,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:04:17,578 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-11-22 20:04:17,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-22 20:04:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:18,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 20:04:18,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:18,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:04:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:18,734 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:04:18,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827095307] [2021-11-22 20:04:18,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827095307] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:18,734 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:18,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-22 20:04:18,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789867024] [2021-11-22 20:04:18,735 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:18,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:04:18,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:04:18,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:04:18,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:04:18,736 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:18,931 INFO L93 Difference]: Finished difference Result 235 states and 273 transitions. [2021-11-22 20:04:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:04:18,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-11-22 20:04:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:18,933 INFO L225 Difference]: With dead ends: 235 [2021-11-22 20:04:18,933 INFO L226 Difference]: Without dead ends: 150 [2021-11-22 20:04:18,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:04:18,933 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 207 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:18,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 338 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:04:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-22 20:04:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-11-22 20:04:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.1724137931034482) internal successors, (170), 149 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2021-11-22 20:04:18,938 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 68 [2021-11-22 20:04:18,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:18,938 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2021-11-22 20:04:18,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:04:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2021-11-22 20:04:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 20:04:18,939 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:18,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:04:18,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-22 20:04:19,143 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-11-22 20:04:19,143 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:04:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2106583766, now seen corresponding path program 1 times [2021-11-22 20:04:19,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:04:19,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671456312] [2021-11-22 20:04:19,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:19,145 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:04:19,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:04:19,159 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-11-22 20:04:19,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-22 20:04:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:29,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-22 20:04:29,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:29,801 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 13 treesize of output 12 [2021-11-22 20:04:30,057 INFO L354 Elim1Store]: treesize reduction 120, result has 23.6 percent of original size [2021-11-22 20:04:30,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 143 treesize of output 164 [2021-11-22 20:04:30,607 INFO L354 Elim1Store]: treesize reduction 45, result has 45.1 percent of original size [2021-11-22 20:04:30,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 82 [2021-11-22 20:04:30,984 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-22 20:04:30,984 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 60 treesize of output 69 [2021-11-22 20:04:31,220 INFO L354 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2021-11-22 20:04:31,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 55 [2021-11-22 20:04:31,542 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 77 treesize of output 73 [2021-11-22 20:04:31,577 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-11-22 20:04:31,578 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 78 treesize of output 81 [2021-11-22 20:04:32,291 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:04:32,292 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 29 treesize of output 30 [2021-11-22 20:04:32,501 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:04:32,501 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 29 treesize of output 30 [2021-11-22 20:04:32,682 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:04:32,682 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 29 treesize of output 30 [2021-11-22 20:04:32,700 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:04:32,700 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 23 treesize of output 23 [2021-11-22 20:04:33,034 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:04:33,034 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 29 treesize of output 29 [2021-11-22 20:04:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:33,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:04:33,627 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| v_ArrVal_1507) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (_ bv0 64)))) is different from false [2021-11-22 20:04:33,649 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base| v_ArrVal_1507) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|)))) is different from false [2021-11-22 20:04:33,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16| (_ BitVec 64)) (v_ArrVal_1507 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1506 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clean_up_harness_#t~mem1328#1.base| v_ArrVal_1506) |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16| v_ArrVal_1507) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (_ bv0 64))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16|))))))) is different from false [2021-11-22 20:04:33,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16| (_ BitVec 64)) (v_ArrVal_1507 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1506 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16|))))) (not (= (_ bv0 64) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_1506) |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16| v_ArrVal_1507) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|))))) is different from false [2021-11-22 20:04:33,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16| (_ BitVec 64)) (v_ArrVal_1505 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1507 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1506 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16|))))) (not (= (_ bv0 64) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_hash_table_has_valid_destroy_functions_#t~mem556#1.base| v_ArrVal_1505))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_1506)) |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16| v_ArrVal_1507) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|))))) is different from false [2021-11-22 20:04:33,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16| (_ BitVec 64)) (v_ArrVal_1505 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1507 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1506 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16|))))) (not (= (_ bv0 64) (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_hash_table_has_valid_destroy_functions_#t~mem553#1.base| v_ArrVal_1504))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_ensure_hash_table_has_valid_destroy_functions_~map#1.base|) |c_ULTIMATE.start_ensure_hash_table_has_valid_destroy_functions_~map#1.offset|) v_ArrVal_1505)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_1506)) |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16| v_ArrVal_1507) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|))))) is different from false [2021-11-22 20:04:33,842 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16| (_ BitVec 64)) (v_ArrVal_1505 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1507 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1506 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16|))))) (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_1504))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_1505)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_1506)) |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_16| v_ArrVal_1507) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (_ bv0 64))))) is different from false [2021-11-22 20:04:34,070 INFO L354 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2021-11-22 20:04:34,070 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 2 case distinctions, treesize of input 201 treesize of output 147 [2021-11-22 20:04:34,109 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:04:34,110 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 48507 treesize of output 42190 [2021-11-22 20:04:36,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37013 treesize of output 34357 [2021-11-22 20:04:36,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34357 treesize of output 33973 [2021-11-22 20:04:36,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33973 treesize of output 33205 [2021-11-22 20:04:36,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33205 treesize of output 32195 [2021-11-22 20:05:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:29,758 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:05:29,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671456312] [2021-11-22 20:05:29,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671456312] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:05:29,759 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:05:29,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 17] imperfect sequences [] total 30 [2021-11-22 20:05:29,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730017541] [2021-11-22 20:05:29,760 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:05:29,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-22 20:05:29,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:05:29,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-22 20:05:29,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=429, Unknown=13, NotChecked=336, Total=870 [2021-11-22 20:05:29,761 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand has 30 states, 30 states have (on average 4.1) internal successors, (123), 30 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:05:31,997 INFO L93 Difference]: Finished difference Result 226 states and 259 transitions. [2021-11-22 20:05:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-22 20:05:31,998 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.1) internal successors, (123), 30 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-22 20:05:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:05:31,999 INFO L225 Difference]: With dead ends: 226 [2021-11-22 20:05:31,999 INFO L226 Difference]: Without dead ends: 152 [2021-11-22 20:05:32,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 6 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=140, Invalid=687, Unknown=13, NotChecked=420, Total=1260 [2021-11-22 20:05:32,000 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 86 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 594 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 20:05:32,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 1923 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 594 Unchecked, 0.4s Time] [2021-11-22 20:05:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-22 20:05:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2021-11-22 20:05:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.1631205673758864) internal successors, (164), 145 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2021-11-22 20:05:32,010 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 69 [2021-11-22 20:05:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:05:32,010 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2021-11-22 20:05:32,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.1) internal successors, (123), 30 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2021-11-22 20:05:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 20:05:32,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:05:32,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:05:32,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-22 20:05:32,223 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-11-22 20:05:32,223 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:05:32,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:05:32,224 INFO L85 PathProgramCache]: Analyzing trace with hash 583250937, now seen corresponding path program 1 times [2021-11-22 20:05:32,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:05:32,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101666354] [2021-11-22 20:05:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:05:32,225 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:05:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:05:32,226 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-11-22 20:05:32,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-22 20:05:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:05:33,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-22 20:05:33,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:05:33,259 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 32 treesize of output 24 [2021-11-22 20:05:33,262 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-11-22 20:05:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:33,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:05:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:33,390 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:05:33,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101666354] [2021-11-22 20:05:33,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101666354] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:05:33,390 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:05:33,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-22 20:05:33,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915881362] [2021-11-22 20:05:33,391 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:05:33,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:05:33,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:05:33,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:05:33,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:05:33,392 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:05:35,411 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2021-11-22 20:05:35,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:05:35,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-22 20:05:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:05:35,414 INFO L225 Difference]: With dead ends: 236 [2021-11-22 20:05:35,414 INFO L226 Difference]: Without dead ends: 155 [2021-11-22 20:05:35,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-11-22 20:05:35,415 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 185 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:05:35,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 474 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-22 20:05:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-22 20:05:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2021-11-22 20:05:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.1418439716312057) internal successors, (161), 145 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2021-11-22 20:05:35,423 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 70 [2021-11-22 20:05:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:05:35,424 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2021-11-22 20:05:35,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2021-11-22 20:05:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 20:05:35,425 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:05:35,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:05:35,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-22 20:05:35,637 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-11-22 20:05:35,637 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:05:35,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:05:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1164901697, now seen corresponding path program 1 times [2021-11-22 20:05:35,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:05:35,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820068272] [2021-11-22 20:05:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:05:35,639 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:05:35,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:05:35,641 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-11-22 20:05:35,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-22 20:05:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:05:36,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 1471 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-22 20:05:36,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:05:36,787 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 32 treesize of output 24 [2021-11-22 20:05:36,789 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-11-22 20:05:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:36,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:05:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:36,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:05:36,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820068272] [2021-11-22 20:05:36,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820068272] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:05:36,958 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:05:36,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-22 20:05:36,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470069982] [2021-11-22 20:05:36,958 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:05:36,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:05:36,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:05:36,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:05:36,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:05:36,959 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:05:38,351 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-11-22 20:05:38,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 20:05:38,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-22 20:05:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:05:38,353 INFO L225 Difference]: With dead ends: 158 [2021-11-22 20:05:38,353 INFO L226 Difference]: Without dead ends: 146 [2021-11-22 20:05:38,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:05:38,353 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 148 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:05:38,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 398 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-22 20:05:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-22 20:05:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2021-11-22 20:05:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 141 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2021-11-22 20:05:38,363 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 71 [2021-11-22 20:05:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:05:38,363 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2021-11-22 20:05:38,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2021-11-22 20:05:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-22 20:05:38,364 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:05:38,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:05:38,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-22 20:05:38,575 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-11-22 20:05:38,575 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:05:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:05:38,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1202094834, now seen corresponding path program 1 times [2021-11-22 20:05:38,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:05:38,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185799723] [2021-11-22 20:05:38,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:05:38,577 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:05:38,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:05:38,580 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-11-22 20:05:38,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-22 20:05:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:05:39,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 1515 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-22 20:05:39,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:05:39,620 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 27 [2021-11-22 20:05:39,622 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 27 treesize of output 19 [2021-11-22 20:05:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:39,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:05:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:39,780 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:05:39,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185799723] [2021-11-22 20:05:39,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185799723] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:05:39,780 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:05:39,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2021-11-22 20:05:39,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174994340] [2021-11-22 20:05:39,781 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:05:39,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:05:39,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:05:39,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:05:39,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:05:39,781 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:05:42,206 INFO L93 Difference]: Finished difference Result 210 states and 234 transitions. [2021-11-22 20:05:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 20:05:42,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-22 20:05:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:05:42,207 INFO L225 Difference]: With dead ends: 210 [2021-11-22 20:05:42,207 INFO L226 Difference]: Without dead ends: 146 [2021-11-22 20:05:42,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:05:42,208 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 101 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:05:42,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 639 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-22 20:05:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-22 20:05:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2021-11-22 20:05:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 141 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2021-11-22 20:05:42,214 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 82 [2021-11-22 20:05:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:05:42,214 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2021-11-22 20:05:42,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2021-11-22 20:05:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 20:05:42,216 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:05:42,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:05:42,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-11-22 20:05:42,417 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-11-22 20:05:42,417 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:05:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:05:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash 180753076, now seen corresponding path program 1 times [2021-11-22 20:05:42,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:05:42,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923125211] [2021-11-22 20:05:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:05:42,420 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:05:42,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:05:42,421 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-11-22 20:05:42,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-22 20:05:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:05:43,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 20:05:43,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:05:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:43,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:05:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:43,687 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:05:43,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923125211] [2021-11-22 20:05:43,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923125211] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:05:43,687 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:05:43,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 20:05:43,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840980064] [2021-11-22 20:05:43,688 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:05:43,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:05:43,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:05:43,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:05:43,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:05:43,689 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:05:43,712 INFO L93 Difference]: Finished difference Result 190 states and 207 transitions. [2021-11-22 20:05:43,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:05:43,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 20:05:43,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:05:43,713 INFO L225 Difference]: With dead ends: 190 [2021-11-22 20:05:43,714 INFO L226 Difference]: Without dead ends: 143 [2021-11-22 20:05:43,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:05:43,715 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:05:43,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:05:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-22 20:05:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-22 20:05:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 142 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2021-11-22 20:05:43,735 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 85 [2021-11-22 20:05:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:05:43,736 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2021-11-22 20:05:43,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2021-11-22 20:05:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 20:05:43,737 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:05:43,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:05:43,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-22 20:05:43,959 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-11-22 20:05:43,959 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:05:43,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:05:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1955760438, now seen corresponding path program 1 times [2021-11-22 20:05:43,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:05:43,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700784867] [2021-11-22 20:05:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:05:43,961 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:05:43,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:05:43,962 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-11-22 20:05:43,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-22 20:05:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:05:44,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 1542 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 20:05:45,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:05:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:45,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:05:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:45,183 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:05:45,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700784867] [2021-11-22 20:05:45,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700784867] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:05:45,183 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:05:45,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-22 20:05:45,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855731003] [2021-11-22 20:05:45,184 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:05:45,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:05:45,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:05:45,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:05:45,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:05:45,185 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:05:45,219 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2021-11-22 20:05:45,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:05:45,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 20:05:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:05:45,220 INFO L225 Difference]: With dead ends: 143 [2021-11-22 20:05:45,220 INFO L226 Difference]: Without dead ends: 141 [2021-11-22 20:05:45,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:05:45,221 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 80 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:05:45,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 393 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:05:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-22 20:05:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-11-22 20:05:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 138 states have (on average 1.1159420289855073) internal successors, (154), 140 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2021-11-22 20:05:45,231 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 85 [2021-11-22 20:05:45,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:05:45,232 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2021-11-22 20:05:45,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2021-11-22 20:05:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 20:05:45,233 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:05:45,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:05:45,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-22 20:05:45,443 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-11-22 20:05:45,443 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:05:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:05:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1709760616, now seen corresponding path program 1 times [2021-11-22 20:05:45,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:05:45,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936325214] [2021-11-22 20:05:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:05:45,445 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:05:45,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:05:45,446 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-11-22 20:05:45,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-22 20:05:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:05:46,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-22 20:05:46,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:05:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:46,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:05:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:05:48,792 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:05:48,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936325214] [2021-11-22 20:05:48,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936325214] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:05:48,792 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:05:48,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-22 20:05:48,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583637996] [2021-11-22 20:05:48,792 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:05:48,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:05:48,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:05:48,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:05:48,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=18, Unknown=1, NotChecked=0, Total=30 [2021-11-22 20:05:48,793 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:05:48,820 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2021-11-22 20:05:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:05:48,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-22 20:05:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:05:48,821 INFO L225 Difference]: With dead ends: 141 [2021-11-22 20:05:48,821 INFO L226 Difference]: Without dead ends: 139 [2021-11-22 20:05:48,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=11, Invalid=18, Unknown=1, NotChecked=0, Total=30 [2021-11-22 20:05:48,822 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 31 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:05:48,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 522 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2021-11-22 20:05:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-22 20:05:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-11-22 20:05:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 137 states have (on average 1.1094890510948905) internal successors, (152), 138 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2021-11-22 20:05:48,828 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 87 [2021-11-22 20:05:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:05:48,829 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2021-11-22 20:05:48,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:05:48,829 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2021-11-22 20:05:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-22 20:05:48,829 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:05:48,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 20:05:48,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-22 20:05:49,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 20:05:49,035 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-22 20:05:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:05:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash 377734278, now seen corresponding path program 1 times [2021-11-22 20:05:49,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:05:49,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670461644] [2021-11-22 20:05:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:05:49,037 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:05:49,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:05:49,038 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 20:05:49,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-22 20:06:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:06:14,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 1601 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-22 20:06:14,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:06:14,140 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 13 treesize of output 12 [2021-11-22 20:06:14,443 INFO L354 Elim1Store]: treesize reduction 120, result has 23.6 percent of original size [2021-11-22 20:06:14,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 197 treesize of output 216 [2021-11-22 20:06:15,076 INFO L354 Elim1Store]: treesize reduction 45, result has 45.1 percent of original size [2021-11-22 20:06:15,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 85 [2021-11-22 20:06:15,498 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-22 20:06:15,498 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 57 treesize of output 66 [2021-11-22 20:06:15,861 INFO L354 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2021-11-22 20:06:15,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 62 [2021-11-22 20:06:16,173 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 83 treesize of output 79 [2021-11-22 20:06:16,191 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-11-22 20:06:16,191 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 84 treesize of output 87 [2021-11-22 20:06:16,797 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:06:16,798 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 29 treesize of output 30 [2021-11-22 20:06:17,018 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:06:17,018 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 29 treesize of output 30 [2021-11-22 20:06:17,177 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:06:17,178 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 26 treesize of output 26 [2021-11-22 20:06:17,218 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:06:17,219 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-11-22 20:06:17,524 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:06:17,525 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 29 treesize of output 29 [2021-11-22 20:06:18,834 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:06:18,835 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 29 treesize of output 30 [2021-11-22 20:06:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:06:19,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:06:19,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clear_~state~13#1.base| v_ArrVal_2672) |c_ULTIMATE.start_aws_hash_table_clear_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_clear_~map#1.offset|)))) is different from false [2021-11-22 20:06:19,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clear_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_clear_~map#1.offset|) v_ArrVal_2672) |c_ULTIMATE.start_aws_hash_table_clear_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_clear_~map#1.offset|)))) is different from false [2021-11-22 20:06:19,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clean_up_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_~map#1.offset|) v_ArrVal_2672) |c_ULTIMATE.start_aws_hash_table_clean_up_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_~map#1.offset|)))) is different from false [2021-11-22 20:06:19,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2672) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|)))) is different from false [2021-11-22 20:06:19,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2671 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| v_ArrVal_2671))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2672)) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (_ bv0 64)))) is different from false [2021-11-22 20:06:19,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2671 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base| v_ArrVal_2671))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2672)) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|)))) is different from false [2021-11-22 20:06:19,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2671 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2670 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18| (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18|)))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clean_up_harness_#t~mem1328#1.base| v_ArrVal_2670) |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18| v_ArrVal_2671))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2672)) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|))))) is different from false [2021-11-22 20:06:19,612 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2671 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2670 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18| (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18|)))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2670) |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18| v_ArrVal_2671))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2672)) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|))))) is different from false [2021-11-22 20:06:19,638 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2669 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2672 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2671 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2670 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18| (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18|)))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_hash_table_has_valid_destroy_functions_#t~mem556#1.base| v_ArrVal_2669))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2670)) |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18| v_ArrVal_2671))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2672)) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|))))) is different from false [2021-11-22 20:06:19,706 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2669 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2668 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2672 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2671 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2670 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18| (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18|)))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_hash_table_has_valid_destroy_functions_#t~mem553#1.base| v_ArrVal_2668))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_ensure_hash_table_has_valid_destroy_functions_~map#1.base|) |c_ULTIMATE.start_ensure_hash_table_has_valid_destroy_functions_~map#1.offset|) v_ArrVal_2669)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2670)) |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18| v_ArrVal_2671))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2672)) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|))))) is different from false [2021-11-22 20:06:19,782 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2669 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2668 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2672 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2671 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2670 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18| (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18|)))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2668))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2669)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2670)) |v_ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base_18| v_ArrVal_2671))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) v_ArrVal_2672)) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|))))) is different from false [2021-11-22 20:06:20,037 INFO L354 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2021-11-22 20:06:20,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 365 treesize of output 231 [2021-11-22 20:06:20,290 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:06:20,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 1511823705 treesize of output 1356725276 Killed by 15