./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b 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_array_list_clear_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 602c22a5759f33fe3c7a18e3ef1531ea38defb370e298f7d0c16de4a5734f1a7 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-03 21:50:45,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 21:50:45,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 21:50:45,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 21:50:45,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 21:50:45,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 21:50:45,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 21:50:45,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 21:50:45,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 21:50:45,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 21:50:45,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 21:50:45,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 21:50:45,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 21:50:45,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 21:50:45,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 21:50:45,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 21:50:45,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 21:50:45,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 21:50:45,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 21:50:46,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 21:50:46,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 21:50:46,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 21:50:46,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 21:50:46,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 21:50:46,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 21:50:46,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 21:50:46,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 21:50:46,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 21:50:46,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 21:50:46,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 21:50:46,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 21:50:46,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 21:50:46,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 21:50:46,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 21:50:46,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 21:50:46,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 21:50:46,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 21:50:46,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 21:50:46,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 21:50:46,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 21:50:46,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 21:50:46,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-03 21:50:46,042 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 21:50:46,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 21:50:46,043 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-03 21:50:46,043 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-03 21:50:46,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 21:50:46,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 21:50:46,045 INFO L138 SettingsManager]: * Use SBE=true [2021-11-03 21:50:46,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 21:50:46,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 21:50:46,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 21:50:46,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 21:50:46,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 21:50:46,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 21:50:46,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 21:50:46,046 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 21:50:46,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 21:50:46,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 21:50:46,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 21:50:46,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 21:50:46,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 21:50:46,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 21:50:46,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 21:50:46,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 21:50:46,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-03 21:50:46,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 21:50:46,048 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-03 21:50:46,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-03 21:50:46,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 21:50:46,048 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 21:50:46,048 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 -> 602c22a5759f33fe3c7a18e3ef1531ea38defb370e298f7d0c16de4a5734f1a7 [2021-11-03 21:50:46,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 21:50:46,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 21:50:46,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 21:50:46,263 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 21:50:46,263 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 21:50:46,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i [2021-11-03 21:50:46,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54285118/7fad3985334542e2904c7f2306ac5e33/FLAG8bb63cd35 [2021-11-03 21:50:46,995 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 21:50:46,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i [2021-11-03 21:50:47,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54285118/7fad3985334542e2904c7f2306ac5e33/FLAG8bb63cd35 [2021-11-03 21:50:47,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54285118/7fad3985334542e2904c7f2306ac5e33 [2021-11-03 21:50:47,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 21:50:47,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 21:50:47,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 21:50:47,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 21:50:47,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 21:50:47,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:50:47" (1/1) ... [2021-11-03 21:50:47,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74bf9e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:47, skipping insertion in model container [2021-11-03 21:50:47,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:50:47" (1/1) ... [2021-11-03 21:50:47,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 21:50:47,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 21:50:47,620 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i[4494,4507] [2021-11-03 21:50:47,628 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i[4554,4567] [2021-11-03 21:50:47,641 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 21:50:47,649 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 21:50:48,022 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 21:50:48,077 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,087 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,088 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,088 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,089 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,095 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,095 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,096 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,097 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,098 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,098 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,098 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,099 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,265 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 21:50:48,266 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 21:50:48,266 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 21:50:48,267 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 21:50:48,268 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 21:50:48,268 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 21:50:48,268 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 21:50:48,269 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 21:50:48,269 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 21:50:48,269 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 21:50:48,329 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,334 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 21:50:48,451 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 21:50:48,467 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i[4494,4507] [2021-11-03 21:50:48,468 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i[4554,4567] [2021-11-03 21:50:48,469 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 21:50:48,470 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 21:50:48,488 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 21:50:48,513 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,517 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,517 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,518 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,518 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,522 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,525 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,526 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,528 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,529 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,529 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,529 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,530 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,559 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 21:50:48,559 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 21:50:48,560 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 21:50:48,560 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 21:50:48,562 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 21:50:48,562 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 21:50:48,562 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 21:50:48,563 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 21:50:48,563 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 21:50:48,563 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 21:50:48,581 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,588 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:50:48,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 21:50:48,752 INFO L208 MainTranslator]: Completed translation [2021-11-03 21:50:48,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48 WrapperNode [2021-11-03 21:50:48,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 21:50:48,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 21:50:48,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 21:50:48,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 21:50:48,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 21:50:48,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 21:50:48,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 21:50:48,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 21:50:48,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 21:50:48,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 21:50:48,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 21:50:48,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 21:50:48,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (1/1) ... [2021-11-03 21:50:48,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 21:50:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:50:48,949 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-03 21:50:48,985 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-03 21:50:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 21:50:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 21:50:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 21:50:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 21:50:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 21:50:49,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 21:50:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 21:50:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-03 21:50:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 21:50:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 21:50:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 21:50:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 21:50:53,181 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 21:50:53,181 INFO L299 CfgBuilder]: Removed 92 assume(true) statements. [2021-11-03 21:50:53,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:50:53 BoogieIcfgContainer [2021-11-03 21:50:53,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 21:50:53,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 21:50:53,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 21:50:53,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 21:50:53,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:50:47" (1/3) ... [2021-11-03 21:50:53,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7307c2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:50:53, skipping insertion in model container [2021-11-03 21:50:53,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:50:48" (2/3) ... [2021-11-03 21:50:53,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7307c2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:50:53, skipping insertion in model container [2021-11-03 21:50:53,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:50:53" (3/3) ... [2021-11-03 21:50:53,188 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_clear_harness.i [2021-11-03 21:50:53,192 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 21:50:53,192 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-03 21:50:53,221 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 21:50:53,225 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-03 21:50:53,225 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-03 21:50:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 112 states have internal predecessors, (148), 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-03 21:50:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 21:50:53,240 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:50:53,240 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] [2021-11-03 21:50:53,240 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:50:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:50:53,244 INFO L85 PathProgramCache]: Analyzing trace with hash -787916854, now seen corresponding path program 1 times [2021-11-03 21:50:53,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:50:53,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979312930] [2021-11-03 21:50:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:50:53,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:50:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:50:53,653 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-03 21:50:53,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:50:53,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979312930] [2021-11-03 21:50:53,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979312930] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:50:53,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:50:53,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 21:50:53,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38716530] [2021-11-03 21:50:53,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:50:53,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 21:50:53,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:50:53,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 21:50:53,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 21:50:53,676 INFO L87 Difference]: Start difference. First operand has 113 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 112 states have internal predecessors, (148), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-03 21:50:55,734 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:50:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:50:56,612 INFO L93 Difference]: Finished difference Result 222 states and 291 transitions. [2021-11-03 21:50:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 21:50:56,614 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 25 [2021-11-03 21:50:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:50:56,619 INFO L225 Difference]: With dead ends: 222 [2021-11-03 21:50:56,619 INFO L226 Difference]: Without dead ends: 108 [2021-11-03 21:50:56,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.02ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 21:50:56,623 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2618.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.39ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2886.75ms IncrementalHoareTripleChecker+Time [2021-11-03 21:50:56,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 136 Unknown, 0 Unchecked, 2.39ms Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 2886.75ms Time] [2021-11-03 21:50:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-03 21:50:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-03 21:50:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 101 states have (on average 1.297029702970297) internal successors, (131), 107 states have internal predecessors, (131), 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-03 21:50:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2021-11-03 21:50:56,664 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 25 [2021-11-03 21:50:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:50:56,664 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2021-11-03 21:50:56,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-03 21:50:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2021-11-03 21:50:56,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 21:50:56,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:50:56,665 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] [2021-11-03 21:50:56,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 21:50:56,666 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:50:56,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:50:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1180579266, now seen corresponding path program 1 times [2021-11-03 21:50:56,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:50:56,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159919915] [2021-11-03 21:50:56,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:50:56,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:50:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:50:56,900 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-03 21:50:56,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:50:56,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159919915] [2021-11-03 21:50:56,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159919915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:50:56,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:50:56,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 21:50:56,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105687489] [2021-11-03 21:50:56,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:50:56,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 21:50:56,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:50:56,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 21:50:56,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 21:50:56,904 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-03 21:50:58,950 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:50:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:50:59,847 INFO L93 Difference]: Finished difference Result 203 states and 247 transitions. [2021-11-03 21:50:59,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 21:50:59,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2021-11-03 21:50:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:50:59,848 INFO L225 Difference]: With dead ends: 203 [2021-11-03 21:50:59,849 INFO L226 Difference]: Without dead ends: 109 [2021-11-03 21:50:59,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.51ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 21:50:59,850 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2748.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.20ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2905.32ms IncrementalHoareTripleChecker+Time [2021-11-03 21:50:59,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 260 Unknown, 0 Unchecked, 5.20ms Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2905.32ms Time] [2021-11-03 21:50:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-03 21:50:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-03 21:50:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 108 states have internal predecessors, (132), 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-03 21:50:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2021-11-03 21:50:59,856 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 25 [2021-11-03 21:50:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:50:59,856 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2021-11-03 21:50:59,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-03 21:50:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2021-11-03 21:50:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 21:50:59,857 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:50:59,857 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] [2021-11-03 21:50:59,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 21:50:59,857 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:50:59,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:50:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1998227716, now seen corresponding path program 1 times [2021-11-03 21:50:59,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:50:59,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471494780] [2021-11-03 21:50:59,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:50:59,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:50:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:51:00,085 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-03 21:51:00,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:51:00,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471494780] [2021-11-03 21:51:00,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471494780] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:51:00,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:51:00,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 21:51:00,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372549485] [2021-11-03 21:51:00,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:51:00,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 21:51:00,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:51:00,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 21:51:00,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 21:51:00,087 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-03 21:51:02,125 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:51:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:51:02,967 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2021-11-03 21:51:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 21:51:02,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2021-11-03 21:51:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:51:02,968 INFO L225 Difference]: With dead ends: 186 [2021-11-03 21:51:02,968 INFO L226 Difference]: Without dead ends: 109 [2021-11-03 21:51:02,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.85ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 21:51:02,970 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2576.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.60ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2851.13ms IncrementalHoareTripleChecker+Time [2021-11-03 21:51:02,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 175 Unknown, 0 Unchecked, 3.60ms Time], IncrementalHoareTripleChecker [4 Valid, 170 Invalid, 1 Unknown, 0 Unchecked, 2851.13ms Time] [2021-11-03 21:51:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-03 21:51:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-03 21:51:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 108 states have internal predecessors, (129), 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-03 21:51:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2021-11-03 21:51:02,978 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 25 [2021-11-03 21:51:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:51:02,978 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2021-11-03 21:51:02,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-03 21:51:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2021-11-03 21:51:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-03 21:51:02,979 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:51:02,979 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] [2021-11-03 21:51:02,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 21:51:02,979 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:51:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:51:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash -582251314, now seen corresponding path program 1 times [2021-11-03 21:51:02,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:51:02,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919231385] [2021-11-03 21:51:02,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:02,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:51:03,040 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 21:51:03,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556459315] [2021-11-03 21:51:03,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:03,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:03,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:51:03,042 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-03 21:51:03,069 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-03 21:51:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:51:03,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 2458 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-03 21:51:03,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:51:03,874 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-03 21:51:03,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 21:51:03,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:51:03,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919231385] [2021-11-03 21:51:03,875 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 21:51:03,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556459315] [2021-11-03 21:51:03,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556459315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:51:03,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:51:03,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 21:51:03,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826062625] [2021-11-03 21:51:03,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:51:03,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 21:51:03,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:51:03,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 21:51:03,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 21:51:03,876 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03 21:51:05,914 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:51:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:51:07,653 INFO L93 Difference]: Finished difference Result 207 states and 248 transitions. [2021-11-03 21:51:07,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 21:51:07,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2021-11-03 21:51:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:51:07,655 INFO L225 Difference]: With dead ends: 207 [2021-11-03 21:51:07,655 INFO L226 Difference]: Without dead ends: 129 [2021-11-03 21:51:07,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.38ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 21:51:07,657 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3362.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.12ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3710.43ms IncrementalHoareTripleChecker+Time [2021-11-03 21:51:07,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 409 Unknown, 0 Unchecked, 8.12ms Time], IncrementalHoareTripleChecker [13 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 3710.43ms Time] [2021-11-03 21:51:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-11-03 21:51:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2021-11-03 21:51:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 110 states have (on average 1.2454545454545454) internal successors, (137), 116 states have internal predecessors, (137), 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-03 21:51:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2021-11-03 21:51:07,662 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 41 [2021-11-03 21:51:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:51:07,662 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2021-11-03 21:51:07,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03 21:51:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2021-11-03 21:51:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-03 21:51:07,669 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:51:07,669 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] [2021-11-03 21:51:07,690 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-03 21:51:07,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:07,871 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:51:07,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:51:07,871 INFO L85 PathProgramCache]: Analyzing trace with hash 4554700, now seen corresponding path program 1 times [2021-11-03 21:51:07,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:51:07,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301290358] [2021-11-03 21:51:07,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:07,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:51:07,916 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 21:51:07,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575751434] [2021-11-03 21:51:07,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:07,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:07,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:51:07,917 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-03 21:51:07,919 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-03 21:51:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:51:08,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 2463 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-03 21:51:08,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:51:08,883 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-03 21:51:08,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 21:51:08,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:51:08,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301290358] [2021-11-03 21:51:08,884 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 21:51:08,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575751434] [2021-11-03 21:51:08,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575751434] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:51:08,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:51:08,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 21:51:08,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949304828] [2021-11-03 21:51:08,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:51:08,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 21:51:08,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:51:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 21:51:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 21:51:08,885 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-03 21:51:10,924 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:51:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:51:11,889 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2021-11-03 21:51:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 21:51:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2021-11-03 21:51:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:51:11,890 INFO L225 Difference]: With dead ends: 162 [2021-11-03 21:51:11,890 INFO L226 Difference]: Without dead ends: 117 [2021-11-03 21:51:11,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 168.10ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 21:51:11,891 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 399 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2588.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.72ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2880.51ms IncrementalHoareTripleChecker+Time [2021-11-03 21:51:11,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 0 Invalid, 196 Unknown, 0 Unchecked, 5.72ms Time], IncrementalHoareTripleChecker [11 Valid, 184 Invalid, 1 Unknown, 0 Unchecked, 2880.51ms Time] [2021-11-03 21:51:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-03 21:51:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-03 21:51:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 116 states have internal predecessors, (136), 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-03 21:51:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2021-11-03 21:51:11,903 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 41 [2021-11-03 21:51:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:51:11,903 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2021-11-03 21:51:11,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-03 21:51:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2021-11-03 21:51:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-03 21:51:11,908 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:51:11,908 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] [2021-11-03 21:51:11,934 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-03 21:51:12,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:12,118 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:51:12,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:51:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash -594325712, now seen corresponding path program 1 times [2021-11-03 21:51:12,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:51:12,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798720532] [2021-11-03 21:51:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:12,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:51:12,234 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 21:51:12,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407753670] [2021-11-03 21:51:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:12,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:12,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:51:12,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 21:51:12,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-03 21:51:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:51:12,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 2558 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-03 21:51:12,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:51:13,971 INFO L354 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-11-03 21:51:13,972 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 45 treesize of output 41 [2021-11-03 21:51:14,056 INFO L354 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-11-03 21:51:14,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2021-11-03 21:51:14,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-03 21:51:14,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-03 21:51:14,817 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-03 21:51:14,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 21:51:14,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:51:14,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798720532] [2021-11-03 21:51:14,817 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 21:51:14,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407753670] [2021-11-03 21:51:14,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407753670] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 21:51:14,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:51:14,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-03 21:51:14,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711370882] [2021-11-03 21:51:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 21:51:14,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 21:51:14,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 21:51:14,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 21:51:14,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-03 21:51:14,819 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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-03 21:51:16,854 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:51:22,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:51:22,339 INFO L93 Difference]: Finished difference Result 284 states and 328 transitions. [2021-11-03 21:51:22,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 21:51:22,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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 49 [2021-11-03 21:51:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:51:22,341 INFO L225 Difference]: With dead ends: 284 [2021-11-03 21:51:22,341 INFO L226 Difference]: Without dead ends: 216 [2021-11-03 21:51:22,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2478.47ms TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2021-11-03 21:51:22,342 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 763 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 90 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5222.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.93ms SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5682.85ms IncrementalHoareTripleChecker+Time [2021-11-03 21:51:22,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 0 Invalid, 1305 Unknown, 0 Unchecked, 21.93ms Time], IncrementalHoareTripleChecker [90 Valid, 1214 Invalid, 1 Unknown, 0 Unchecked, 5682.85ms Time] [2021-11-03 21:51:22,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-03 21:51:22,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 170. [2021-11-03 21:51:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 163 states have (on average 1.2147239263803682) internal successors, (198), 169 states have internal predecessors, (198), 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-03 21:51:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2021-11-03 21:51:22,349 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 49 [2021-11-03 21:51:22,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:51:22,349 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2021-11-03 21:51:22,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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-03 21:51:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2021-11-03 21:51:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-03 21:51:22,350 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:51:22,351 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] [2021-11-03 21:51:22,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-03 21:51:22,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:22,569 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:51:22,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:51:22,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1605442962, now seen corresponding path program 1 times [2021-11-03 21:51:22,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 21:51:22,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958325468] [2021-11-03 21:51:22,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:22,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 21:51:22,688 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 21:51:22,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1344245078] [2021-11-03 21:51:22,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:51:22,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:51:22,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:51:22,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 21:51:22,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-03 21:52:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:52:57,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 2557 conjuncts, 219 conjunts are in the unsatisfiable core [2021-11-03 21:52:57,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:52:58,039 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-03 21:52:58,344 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 9 treesize of output 3 [2021-11-03 21:52:58,362 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 9 treesize of output 3 [2021-11-03 21:52:58,796 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-03 21:52:58,796 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 6 case distinctions, treesize of input 29 treesize of output 33 [2021-11-03 21:52:59,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2021-11-03 21:53:00,301 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-03 21:53:00,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 48 [2021-11-03 21:53:01,606 INFO L354 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2021-11-03 21:53:01,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 62 [2021-11-03 21:53:03,072 INFO L354 Elim1Store]: treesize reduction 48, result has 40.7 percent of original size [2021-11-03 21:53:03,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 77 [2021-11-03 21:53:03,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-03 21:53:03,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:53:03,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:53:03,555 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-03 21:53:03,636 INFO L354 Elim1Store]: treesize reduction 47, result has 24.2 percent of original size [2021-11-03 21:53:03,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 56 [2021-11-03 21:53:06,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 21:53:06,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958325468] [2021-11-03 21:53:06,033 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 21:53:06,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344245078] [2021-11-03 21:53:06,033 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base|] [2021-11-03 21:53:06,033 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:53:06,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-03 21:53:06,033 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-03 21:53:06,033 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-03 21:53:06,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-11-03 21:53:06,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-11-03 21:53:06,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2021-11-03 21:53:06,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2021-11-03 21:53:06,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2021-11-03 21:53:06,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-11-03 21:53:06,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-11-03 21:53:06,241 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forcibly destroying the process [2021-11-03 21:53:06,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-03 21:53:06,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 21:53:06,248 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-11-03 21:53:06,249 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 21:53:06,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 09:53:06 BoogieIcfgContainer [2021-11-03 21:53:06,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 21:53:06,281 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 21:53:06,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 21:53:06,281 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 21:53:06,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:50:53" (3/4) ... [2021-11-03 21:53:06,283 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-03 21:53:06,283 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 21:53:06,284 INFO L158 Benchmark]: Toolchain (without parser) took 138935.89ms. Allocated memory was 107.0MB in the beginning and 780.1MB in the end (delta: 673.2MB). Free memory was 80.5MB in the beginning and 384.4MB in the end (delta: -303.8MB). Peak memory consumption was 367.9MB. Max. memory is 16.1GB. [2021-11-03 21:53:06,284 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 107.0MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-03 21:53:06,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1402.63ms. Allocated memory was 107.0MB in the beginning and 163.6MB in the end (delta: 56.6MB). Free memory was 80.1MB in the beginning and 91.2MB in the end (delta: -11.1MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2021-11-03 21:53:06,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.34ms. Allocated memory is still 163.6MB. Free memory was 91.2MB in the beginning and 80.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-03 21:53:06,285 INFO L158 Benchmark]: Boogie Preprocessor took 48.11ms. Allocated memory is still 163.6MB. Free memory was 80.7MB in the beginning and 73.5MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-03 21:53:06,285 INFO L158 Benchmark]: RCFGBuilder took 4273.42ms. Allocated memory was 163.6MB in the beginning and 627.0MB in the end (delta: 463.5MB). Free memory was 73.5MB in the beginning and 326.9MB in the end (delta: -253.4MB). Peak memory consumption was 215.3MB. Max. memory is 16.1GB. [2021-11-03 21:53:06,285 INFO L158 Benchmark]: TraceAbstraction took 133096.37ms. Allocated memory was 627.0MB in the beginning and 780.1MB in the end (delta: 153.1MB). Free memory was 325.8MB in the beginning and 385.4MB in the end (delta: -59.6MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2021-11-03 21:53:06,285 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 780.1MB. Free memory was 385.4MB in the beginning and 384.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-03 21:53:06,287 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.19ms. Allocated memory is still 107.0MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1402.63ms. Allocated memory was 107.0MB in the beginning and 163.6MB in the end (delta: 56.6MB). Free memory was 80.1MB in the beginning and 91.2MB in the end (delta: -11.1MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.34ms. Allocated memory is still 163.6MB. Free memory was 91.2MB in the beginning and 80.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.11ms. Allocated memory is still 163.6MB. Free memory was 80.7MB in the beginning and 73.5MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 4273.42ms. Allocated memory was 163.6MB in the beginning and 627.0MB in the end (delta: 463.5MB). Free memory was 73.5MB in the beginning and 326.9MB in the end (delta: -253.4MB). Peak memory consumption was 215.3MB. Max. memory is 16.1GB. * TraceAbstraction took 133096.37ms. Allocated memory was 627.0MB in the beginning and 780.1MB in the end (delta: 153.1MB). Free memory was 325.8MB in the beginning and 385.4MB in the end (delta: -59.6MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 780.1MB. Free memory was 385.4MB in the beginning and 384.4MB in the end (delta: 1.0MB). 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.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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 7546. Possible FailurePath: [L2762-L2767] 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, }; [L7141] static __thread int tl_last_error = 0; [L7545-L7693] 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", } , }; [L7696-L7699] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7701-L7710] 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.") } , }; [L7712-L7715] 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])), }; [L7717-L7721] static _Bool s_common_library_initialized = 0 ; [L7735] struct aws_array_list list = {0, __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), 0}; [L7005] EXPR list->item_size [L7004-L7005] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L7008] EXPR list->length [L7007-L7008] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L7009] return item_size_is_bounded && length_is_bounded; [L211] COND FALSE !(!cond) [L7013] EXPR list->current_size [L7013] list->current_size == 0 && list->length == 0 [L7013] EXPR list->length [L7013] list->current_size == 0 && list->length == 0 [L7013] COND TRUE list->current_size == 0 && list->length == 0 [L7014] list->data [L211] COND FALSE !(!cond) [L2786] return &s_can_fail_allocator_static; [L7017] list->alloc = can_fail_allocator() [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L211] COND FALSE !(!cond) [L7743] struct aws_array_list old = list; [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L211] COND FALSE !(!cond) [L3451] list->data [L3451] COND FALSE !(list->data) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [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. - 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, 113 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 133029.10ms, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 20.36ms, AutomataDifference: 23110.18ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 7.02ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1309 SdHoareTripleChecker+Valid, 20916.98ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1309 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 19117.64ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 983 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2357 IncrementalHoareTripleChecker+Invalid, 2481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 0 mSDtfsCounter, 2357 mSolverCounterSat, 46.96ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2758.33ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 65.01ms AutomataMinimizationTime, 6 MinimizatonAttempts, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 453.75ms SsaConstructionTime, 96666.96ms SatisfiabilityAnalysisTime, 11175.00ms InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 848 SizeOfPredicates, 32 NumberOfNonLiveVariables, 10036 ConjunctsInSsa, 288 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-03 21:53:06,496 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-03 21:53:06,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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_array_list_clear_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 602c22a5759f33fe3c7a18e3ef1531ea38defb370e298f7d0c16de4a5734f1a7 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-03 21:53:08,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 21:53:08,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 21:53:08,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 21:53:08,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 21:53:08,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 21:53:08,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 21:53:08,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 21:53:08,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 21:53:08,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 21:53:08,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 21:53:08,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 21:53:08,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 21:53:08,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 21:53:08,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 21:53:08,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 21:53:08,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 21:53:08,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 21:53:08,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 21:53:08,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 21:53:08,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 21:53:08,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 21:53:08,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 21:53:08,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 21:53:08,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 21:53:08,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 21:53:08,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 21:53:08,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 21:53:08,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 21:53:08,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 21:53:08,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 21:53:08,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 21:53:08,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 21:53:08,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 21:53:08,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 21:53:08,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 21:53:08,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 21:53:08,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 21:53:08,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 21:53:08,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 21:53:08,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 21:53:08,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-03 21:53:08,177 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 21:53:08,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 21:53:08,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-03 21:53:08,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-03 21:53:08,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 21:53:08,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 21:53:08,181 INFO L138 SettingsManager]: * Use SBE=true [2021-11-03 21:53:08,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 21:53:08,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 21:53:08,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 21:53:08,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 21:53:08,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 21:53:08,183 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-03 21:53:08,183 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-03 21:53:08,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 21:53:08,183 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 21:53:08,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 21:53:08,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 21:53:08,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 21:53:08,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 21:53:08,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 21:53:08,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 21:53:08,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 21:53:08,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 21:53:08,184 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-03 21:53:08,184 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-03 21:53:08,184 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-03 21:53:08,185 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-03 21:53:08,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 21:53:08,185 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 21:53:08,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 21:53:08,185 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 -> 602c22a5759f33fe3c7a18e3ef1531ea38defb370e298f7d0c16de4a5734f1a7 [2021-11-03 21:53:08,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 21:53:08,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 21:53:08,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 21:53:08,464 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 21:53:08,464 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 21:53:08,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i [2021-11-03 21:53:08,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef69473f/89557beb702645e08f63d7531d8cfaad/FLAG4b2795213 [2021-11-03 21:53:09,121 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 21:53:09,121 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i [2021-11-03 21:53:09,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef69473f/89557beb702645e08f63d7531d8cfaad/FLAG4b2795213 [2021-11-03 21:53:09,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef69473f/89557beb702645e08f63d7531d8cfaad [2021-11-03 21:53:09,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 21:53:09,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 21:53:09,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 21:53:09,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 21:53:09,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 21:53:09,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:53:09" (1/1) ... [2021-11-03 21:53:09,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9a0028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:09, skipping insertion in model container [2021-11-03 21:53:09,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:53:09" (1/1) ... [2021-11-03 21:53:09,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 21:53:09,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 21:53:09,808 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i[4494,4507] [2021-11-03 21:53:09,812 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i[4554,4567] [2021-11-03 21:53:09,822 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 21:53:09,825 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 21:53:10,244 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 21:53:10,284 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,285 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,285 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,286 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,286 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,295 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,296 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,297 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,298 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,299 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,300 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,300 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,300 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,533 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 21:53:10,534 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 21:53:10,534 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 21:53:10,535 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 21:53:10,536 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 21:53:10,537 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 21:53:10,537 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 21:53:10,538 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 21:53:10,538 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 21:53:10,539 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 21:53:10,601 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,606 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 21:53:10,657 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 21:53:10,666 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i[4494,4507] [2021-11-03 21:53:10,666 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_clear_harness.i[4554,4567] [2021-11-03 21:53:10,667 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 21:53:10,668 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 21:53:10,686 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 21:53:10,711 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,716 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,718 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,718 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,719 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,723 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,726 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,728 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,728 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,729 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,730 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,731 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,732 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,768 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 21:53:10,769 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 21:53:10,769 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 21:53:10,773 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 21:53:10,774 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 21:53:10,775 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 21:53:10,775 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 21:53:10,775 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 21:53:10,776 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 21:53:10,776 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 21:53:10,793 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,813 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 21:53:10,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 21:53:11,026 INFO L208 MainTranslator]: Completed translation [2021-11-03 21:53:11,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11 WrapperNode [2021-11-03 21:53:11,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 21:53:11,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 21:53:11,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 21:53:11,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 21:53:11,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11" (1/1) ... [2021-11-03 21:53:11,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11" (1/1) ... [2021-11-03 21:53:11,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 21:53:11,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 21:53:11,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 21:53:11,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 21:53:11,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11" (1/1) ... [2021-11-03 21:53:11,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11" (1/1) ... [2021-11-03 21:53:11,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11" (1/1) ... [2021-11-03 21:53:11,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11" (1/1) ... [2021-11-03 21:53:11,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11" (1/1) ... [2021-11-03 21:53:11,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11" (1/1) ... [2021-11-03 21:53:11,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11" (1/1) ... [2021-11-03 21:53:11,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 21:53:11,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 21:53:11,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 21:53:11,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 21:53:11,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11" (1/1) ... [2021-11-03 21:53:11,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 21:53:11,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 21:53:11,256 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-03 21:53:11,283 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-03 21:53:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 21:53:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-03 21:53:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-03 21:53:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-03 21:53:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 21:53:11,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 21:53:11,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 21:53:11,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 21:53:11,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-03 21:53:11,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 21:53:11,297 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-03 21:53:11,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 21:53:11,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-03 21:53:11,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 21:53:17,084 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 21:53:17,084 INFO L299 CfgBuilder]: Removed 92 assume(true) statements. [2021-11-03 21:53:17,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:53:17 BoogieIcfgContainer [2021-11-03 21:53:17,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 21:53:17,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 21:53:17,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 21:53:17,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 21:53:17,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:53:09" (1/3) ... [2021-11-03 21:53:17,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d98d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:53:17, skipping insertion in model container [2021-11-03 21:53:17,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:53:11" (2/3) ... [2021-11-03 21:53:17,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d98d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:53:17, skipping insertion in model container [2021-11-03 21:53:17,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:53:17" (3/3) ... [2021-11-03 21:53:17,092 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_clear_harness.i [2021-11-03 21:53:17,096 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 21:53:17,096 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-03 21:53:17,126 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 21:53:17,131 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-03 21:53:17,131 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-03 21:53:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 112 states have internal predecessors, (148), 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-03 21:53:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 21:53:17,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:53:17,160 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] [2021-11-03 21:53:17,161 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:53:17,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:53:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash -787916854, now seen corresponding path program 1 times [2021-11-03 21:53:17,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:53:17,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975027843] [2021-11-03 21:53:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:53:17,184 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:53:17,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:53:17,186 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-03 21:53:17,187 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-03 21:53:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:53:19,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-03 21:53:19,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:53:19,323 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-03 21:53:19,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:53:19,365 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-03 21:53:19,366 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:53:19,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975027843] [2021-11-03 21:53:19,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975027843] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:53:19,367 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:53:19,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-03 21:53:19,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075664942] [2021-11-03 21:53:19,368 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:53:19,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 21:53:19,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:53:19,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 21:53:19,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 21:53:19,390 INFO L87 Difference]: Start difference. First operand has 113 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 112 states have internal predecessors, (148), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-03 21:53:21,637 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:53:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:53:22,610 INFO L93 Difference]: Finished difference Result 222 states and 291 transitions. [2021-11-03 21:53:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 21:53:22,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 25 [2021-11-03 21:53:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:53:22,620 INFO L225 Difference]: With dead ends: 222 [2021-11-03 21:53:22,624 INFO L226 Difference]: Without dead ends: 108 [2021-11-03 21:53:22,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.13ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 21:53:22,634 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3023.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.02ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3176.33ms IncrementalHoareTripleChecker+Time [2021-11-03 21:53:22,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 136 Unknown, 0 Unchecked, 2.02ms Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 3176.33ms Time] [2021-11-03 21:53:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-03 21:53:22,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-03 21:53:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 101 states have (on average 1.297029702970297) internal successors, (131), 107 states have internal predecessors, (131), 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-03 21:53:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2021-11-03 21:53:22,675 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 25 [2021-11-03 21:53:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:53:22,676 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2021-11-03 21:53:22,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-03 21:53:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2021-11-03 21:53:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 21:53:22,679 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:53:22,679 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] [2021-11-03 21:53:22,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-03 21:53:22,896 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-03 21:53:22,897 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:53:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:53:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1180579266, now seen corresponding path program 1 times [2021-11-03 21:53:22,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:53:22,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976512535] [2021-11-03 21:53:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:53:22,901 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:53:22,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:53:22,904 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-03 21:53:22,911 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-03 21:53:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:53:24,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 21:53:24,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:53:24,981 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-03 21:53:24,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:53:25,058 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-03 21:53:25,059 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:53:25,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976512535] [2021-11-03 21:53:25,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976512535] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:53:25,059 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:53:25,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-03 21:53:25,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565442639] [2021-11-03 21:53:25,059 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:53:25,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 21:53:25,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:53:25,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 21:53:25,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 21:53:25,061 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-03 21:53:27,237 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:53:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:53:28,724 INFO L93 Difference]: Finished difference Result 203 states and 247 transitions. [2021-11-03 21:53:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 21:53:28,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2021-11-03 21:53:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:53:28,725 INFO L225 Difference]: With dead ends: 203 [2021-11-03 21:53:28,725 INFO L226 Difference]: Without dead ends: 109 [2021-11-03 21:53:28,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.32ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 21:53:28,727 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3377.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.32ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3621.69ms IncrementalHoareTripleChecker+Time [2021-11-03 21:53:28,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 260 Unknown, 0 Unchecked, 5.32ms Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 3621.69ms Time] [2021-11-03 21:53:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-03 21:53:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-03 21:53:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 108 states have internal predecessors, (132), 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-03 21:53:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2021-11-03 21:53:28,735 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 25 [2021-11-03 21:53:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:53:28,735 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2021-11-03 21:53:28,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-03 21:53:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2021-11-03 21:53:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-03 21:53:28,737 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:53:28,738 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] [2021-11-03 21:53:28,770 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-03 21:53:28,963 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-03 21:53:28,964 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:53:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:53:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1998227716, now seen corresponding path program 1 times [2021-11-03 21:53:28,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:53:28,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838392276] [2021-11-03 21:53:28,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:53:28,967 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:53:28,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:53:28,969 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-03 21:53:28,971 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-03 21:53:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:53:30,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-03 21:53:30,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:53:31,346 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 21:53:31,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2021-11-03 21:53:31,473 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-03 21:53:31,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:53:31,938 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-03 21:53:31,938 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:53:31,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838392276] [2021-11-03 21:53:31,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838392276] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:53:31,939 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:53:31,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2021-11-03 21:53:31,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212973379] [2021-11-03 21:53:31,939 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:53:31,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 21:53:31,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:53:31,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 21:53:31,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-03 21:53:31,941 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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-03 21:53:34,170 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:53:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:53:41,893 INFO L93 Difference]: Finished difference Result 285 states and 346 transitions. [2021-11-03 21:53:41,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 21:53:41,894 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 25 [2021-11-03 21:53:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:53:41,895 INFO L225 Difference]: With dead ends: 285 [2021-11-03 21:53:41,895 INFO L226 Difference]: Without dead ends: 191 [2021-11-03 21:53:41,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1201.52ms TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-11-03 21:53:41,897 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 491 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8420.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.01ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9153.46ms IncrementalHoareTripleChecker+Time [2021-11-03 21:53:41,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 0 Invalid, 1164 Unknown, 0 Unchecked, 26.01ms Time], IncrementalHoareTripleChecker [16 Valid, 1147 Invalid, 1 Unknown, 0 Unchecked, 9153.46ms Time] [2021-11-03 21:53:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-03 21:53:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 105. [2021-11-03 21:53:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 104 states have internal predecessors, (127), 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-03 21:53:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2021-11-03 21:53:41,904 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 25 [2021-11-03 21:53:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:53:41,905 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2021-11-03 21:53:41,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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-03 21:53:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2021-11-03 21:53:41,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-03 21:53:41,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:53:41,906 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] [2021-11-03 21:53:41,942 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-03 21:53:42,119 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-03 21:53:42,120 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:53:42,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:53:42,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1010769190, now seen corresponding path program 1 times [2021-11-03 21:53:42,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:53:42,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632689133] [2021-11-03 21:53:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:53:42,123 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:53:42,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:53:42,124 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-03 21:53:42,125 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-03 21:53:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:53:44,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 21:53:44,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:53:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:53:44,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:53:44,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-03 21:53:44,450 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:53:44,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632689133] [2021-11-03 21:53:44,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632689133] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:53:44,450 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:53:44,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-03 21:53:44,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562173158] [2021-11-03 21:53:44,450 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:53:44,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 21:53:44,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:53:44,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 21:53:44,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 21:53:44,451 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-03 21:53:46,653 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:53:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:53:47,776 INFO L93 Difference]: Finished difference Result 182 states and 219 transitions. [2021-11-03 21:53:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 21:53:47,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2021-11-03 21:53:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:53:47,777 INFO L225 Difference]: With dead ends: 182 [2021-11-03 21:53:47,778 INFO L226 Difference]: Without dead ends: 105 [2021-11-03 21:53:47,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.80ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 21:53:47,781 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3104.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.00ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3282.88ms IncrementalHoareTripleChecker+Time [2021-11-03 21:53:47,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 168 Unknown, 0 Unchecked, 2.00ms Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 1 Unknown, 0 Unchecked, 3282.88ms Time] [2021-11-03 21:53:47,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-03 21:53:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-11-03 21:53:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 104 states have internal predecessors, (124), 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-03 21:53:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2021-11-03 21:53:47,799 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 28 [2021-11-03 21:53:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:53:47,799 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2021-11-03 21:53:47,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-03 21:53:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2021-11-03 21:53:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-03 21:53:47,800 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:53:47,800 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] [2021-11-03 21:53:47,832 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-03 21:53:48,015 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-03 21:53:48,016 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:53:48,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:53:48,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1709213020, now seen corresponding path program 1 times [2021-11-03 21:53:48,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:53:48,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867079214] [2021-11-03 21:53:48,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:53:48,018 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:53:48,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:53:48,021 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-03 21:53:48,022 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-03 21:53:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:53:50,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-03 21:53:50,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:53:50,400 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-03 21:53:50,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:53:50,521 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-03 21:53:50,521 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:53:50,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867079214] [2021-11-03 21:53:50,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867079214] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:53:50,522 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:53:50,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-03 21:53:50,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52954378] [2021-11-03 21:53:50,522 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:53:50,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 21:53:50,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:53:50,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 21:53:50,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 21:53:50,524 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-03 21:53:52,705 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:53:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:53:54,851 INFO L93 Difference]: Finished difference Result 203 states and 243 transitions. [2021-11-03 21:53:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 21:53:54,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2021-11-03 21:53:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:53:54,853 INFO L225 Difference]: With dead ends: 203 [2021-11-03 21:53:54,853 INFO L226 Difference]: Without dead ends: 125 [2021-11-03 21:53:54,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.14ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 21:53:54,854 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3998.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.83ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4272.54ms IncrementalHoareTripleChecker+Time [2021-11-03 21:53:54,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 397 Unknown, 0 Unchecked, 3.83ms Time], IncrementalHoareTripleChecker [13 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 4272.54ms Time] [2021-11-03 21:53:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-03 21:53:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2021-11-03 21:53:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 112 states have internal predecessors, (132), 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-03 21:53:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2021-11-03 21:53:54,860 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 44 [2021-11-03 21:53:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:53:54,860 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2021-11-03 21:53:54,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-03 21:53:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2021-11-03 21:53:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-03 21:53:54,861 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:53:54,861 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] [2021-11-03 21:53:54,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-03 21:53:55,076 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-03 21:53:55,076 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:53:55,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:53:55,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1122407006, now seen corresponding path program 1 times [2021-11-03 21:53:55,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:53:55,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580470797] [2021-11-03 21:53:55,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:53:55,079 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:53:55,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:53:55,081 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-03 21:53:55,082 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-03 21:53:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:53:57,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 1470 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-03 21:53:57,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:53:58,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-03 21:53:58,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-03 21:53:58,446 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-03 21:53:58,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:54:00,874 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 21:54:00,875 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 40 treesize of output 43 [2021-11-03 21:54:00,937 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-03 21:54:00,938 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 39 treesize of output 34 [2021-11-03 21:54:01,103 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-03 21:54:01,103 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:54:01,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580470797] [2021-11-03 21:54:01,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580470797] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:54:01,104 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:54:01,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-11-03 21:54:01,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887368089] [2021-11-03 21:54:01,104 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:54:01,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 21:54:01,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:54:01,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 21:54:01,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-03 21:54:01,105 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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-03 21:54:03,312 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:08,702 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:10,762 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:13,066 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:15,079 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:17,088 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:20,125 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:22,137 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:24,144 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:25,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:54:25,293 INFO L93 Difference]: Finished difference Result 192 states and 224 transitions. [2021-11-03 21:54:25,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 21:54:25,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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 44 [2021-11-03 21:54:25,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:54:25,295 INFO L225 Difference]: With dead ends: 192 [2021-11-03 21:54:25,295 INFO L226 Difference]: Without dead ends: 131 [2021-11-03 21:54:25,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1793.24ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-03 21:54:25,296 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 20 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22262.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.05ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22904.65ms IncrementalHoareTripleChecker+Time [2021-11-03 21:54:25,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 913 Unknown, 0 Unchecked, 13.05ms Time], IncrementalHoareTripleChecker [20 Valid, 884 Invalid, 9 Unknown, 0 Unchecked, 22904.65ms Time] [2021-11-03 21:54:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-03 21:54:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2021-11-03 21:54:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 111 states have (on average 1.2342342342342343) internal successors, (137), 117 states have internal predecessors, (137), 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-03 21:54:25,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2021-11-03 21:54:25,302 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 44 [2021-11-03 21:54:25,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:54:25,302 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2021-11-03 21:54:25,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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-03 21:54:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2021-11-03 21:54:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-03 21:54:25,303 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:54:25,303 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] [2021-11-03 21:54:25,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-03 21:54:25,519 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-03 21:54:25,526 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:54:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:54:25,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1065148704, now seen corresponding path program 1 times [2021-11-03 21:54:25,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:54:25,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323322535] [2021-11-03 21:54:25,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:54:25,529 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:54:25,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:54:25,531 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-03 21:54:25,532 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-03 21:54:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:54:27,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-03 21:54:27,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:54:28,111 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-03 21:54:28,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:54:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 21:54:28,393 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 21:54:28,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323322535] [2021-11-03 21:54:28,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323322535] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 21:54:28,393 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 21:54:28,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-03 21:54:28,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017088113] [2021-11-03 21:54:28,393 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 21:54:28,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 21:54:28,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 21:54:28,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 21:54:28,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 21:54:28,394 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-03 21:54:30,592 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 21:54:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 21:54:31,930 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2021-11-03 21:54:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 21:54:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 44 [2021-11-03 21:54:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 21:54:31,932 INFO L225 Difference]: With dead ends: 163 [2021-11-03 21:54:31,932 INFO L226 Difference]: Without dead ends: 118 [2021-11-03 21:54:31,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 117.84ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 21:54:31,932 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 269 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3242.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.90ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3439.83ms IncrementalHoareTripleChecker+Time [2021-11-03 21:54:31,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 0 Invalid, 181 Unknown, 0 Unchecked, 3.90ms Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 1 Unknown, 0 Unchecked, 3439.83ms Time] [2021-11-03 21:54:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-03 21:54:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-03 21:54:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 117 states have internal predecessors, (136), 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-03 21:54:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2021-11-03 21:54:31,941 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 44 [2021-11-03 21:54:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 21:54:31,943 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2021-11-03 21:54:31,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-03 21:54:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2021-11-03 21:54:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-03 21:54:31,946 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 21:54:31,947 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] [2021-11-03 21:54:31,991 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-03 21:54:32,147 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-03 21:54:32,148 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 21:54:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 21:54:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash 639277636, now seen corresponding path program 1 times [2021-11-03 21:54:32,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 21:54:32,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664422081] [2021-11-03 21:54:32,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 21:54:32,151 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 21:54:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 21:54:32,152 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-03 21:54:32,153 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-03 21:55:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 21:55:56,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-03 21:55:56,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 21:55:56,085 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-03 21:55:56,633 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-03 21:55:56,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2021-11-03 21:55:56,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:55:56,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:55:56,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:55:56,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2021-11-03 21:55:56,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:55:56,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:55:56,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:55:56,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2021-11-03 21:55:57,198 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 21:55:57,198 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 16 treesize of output 16 [2021-11-03 21:55:57,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 21:55:57,874 INFO L354 Elim1Store]: treesize reduction 183, result has 13.7 percent of original size [2021-11-03 21:55:57,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 51 [2021-11-03 21:56:06,084 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-03 21:56:06,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 21:56:08,605 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_aws_mul_u64_checked_~b (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~a (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64))) (not (= (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| c_ULTIMATE.start_aws_mul_u64_checked_~r.base (let ((.cse1 (bvmul ULTIMATE.start_aws_mul_u64_checked_~a ULTIMATE.start_aws_mul_u64_checked_~b))) (store (store (select |c_#memory_int| c_ULTIMATE.start_aws_mul_u64_checked_~r.base) ULTIMATE.start_aws_mul_u64_checked_~r.offset ((_ extract 31 0) .cse1)) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) ((_ extract 63 32) .cse1)))) c_ULTIMATE.start_aws_array_list_is_valid_~list.base))) (concat (select .cse0 (bvadd c_ULTIMATE.start_aws_array_list_is_valid_~list.offset (_ bv12 64))) (select .cse0 (bvadd (_ bv8 64) c_ULTIMATE.start_aws_array_list_is_valid_~list.offset))))))) is different from false [2021-11-03 21:56:11,251 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53| (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~b (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~a (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53|))) (not (= (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53| (let ((.cse1 (bvmul ULTIMATE.start_aws_mul_u64_checked_~a ULTIMATE.start_aws_mul_u64_checked_~b))) (store (store (select |c_#memory_int| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53|) ULTIMATE.start_aws_mul_u64_checked_~r.offset ((_ extract 31 0) .cse1)) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) ((_ extract 63 32) .cse1)))) c_ULTIMATE.start_aws_array_list_is_valid_~list.base))) (concat (select .cse0 (bvadd c_ULTIMATE.start_aws_array_list_is_valid_~list.offset (_ bv12 64))) (select .cse0 (bvadd (_ bv8 64) c_ULTIMATE.start_aws_array_list_is_valid_~list.offset)))))))) is different from false [2021-11-03 21:56:13,902 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53| (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~b (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~a (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53|))) (not (= (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53| (let ((.cse1 (bvmul ULTIMATE.start_aws_mul_u64_checked_~a ULTIMATE.start_aws_mul_u64_checked_~b))) (store (store (select |c_#memory_int| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53|) ULTIMATE.start_aws_mul_u64_checked_~r.offset ((_ extract 31 0) .cse1)) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) ((_ extract 63 32) .cse1)))) |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.base|))) (concat (select .cse0 (bvadd |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.offset| (_ bv12 64))) (select .cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.offset|)))))))) is different from false [2021-11-03 21:56:16,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53| (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~b (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~a (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 32)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64))) (or (not (= (_ bv0 64) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base (store (select |c_#memory_int| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base) c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset v_DerPreprocessor_1)))) (store .cse1 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53| (let ((.cse2 (bvmul ULTIMATE.start_aws_mul_u64_checked_~a ULTIMATE.start_aws_mul_u64_checked_~b))) (store (store (select .cse1 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53|) ULTIMATE.start_aws_mul_u64_checked_~r.offset ((_ extract 31 0) .cse2)) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) ((_ extract 63 32) .cse2))))) |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.base|))) (concat (select .cse0 (bvadd |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.offset| (_ bv12 64))) (select .cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.offset|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53|))))) is different from false [2021-11-03 21:56:20,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53| (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~b (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 32)) (ULTIMATE.start_aws_mul_u64_checked_~a (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 32)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53|))) (not (= (_ bv0 64) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base (store (store (select |c_#memory_int| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base) (bvadd (_ bv32 64) c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset) v_DerPreprocessor_2) c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset v_DerPreprocessor_1)))) (store .cse1 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53| (let ((.cse2 (bvmul ULTIMATE.start_aws_mul_u64_checked_~a ULTIMATE.start_aws_mul_u64_checked_~b))) (store (store (select .cse1 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53|) ULTIMATE.start_aws_mul_u64_checked_~r.offset ((_ extract 31 0) .cse2)) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) ((_ extract 63 32) .cse2))))) |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.base|))) (concat (select .cse0 (bvadd |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.offset| (_ bv12 64))) (select .cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.offset|)))))))) is different from false [2021-11-03 21:56:23,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53| (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~b (_ BitVec 64)) (v_DerPreprocessor_2 (_ BitVec 32)) (ULTIMATE.start_aws_mul_u64_checked_~a (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 32)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (|v_ULTIMATE.start_bounded_malloc_#res.base_8| (_ BitVec 64))) (or (not (= (_ bv0 64) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base (store (store (select |c_#memory_int| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base) (bvadd (_ bv32 64) c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset) v_DerPreprocessor_2) c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset v_DerPreprocessor_1)))) (store .cse1 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53| (let ((.cse2 (bvmul ULTIMATE.start_aws_mul_u64_checked_~a ULTIMATE.start_aws_mul_u64_checked_~b))) (store (store (select .cse1 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53|) ULTIMATE.start_aws_mul_u64_checked_~r.offset ((_ extract 31 0) .cse2)) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) ((_ extract 63 32) .cse2))))) |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.base|))) (concat (select .cse0 (bvadd |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.offset| (_ bv12 64))) (select .cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.offset|)))))) (not (= (_ bv0 1) (select (store |c_#valid| |v_ULTIMATE.start_bounded_malloc_#res.base_8| (_ bv1 1)) |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_53|))))) is different from false [2021-11-03 21:56:30,544 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-03 21:56:30,545 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 16554633 treesize of output 16161405 [2021-11-03 21:57:08,904 WARN L210 SmtUtils]: Spent 38.36s on a formula simplification that was a NOOP. DAG size: 992 [2021-11-03 21:58:38,903 WARN L210 SmtUtils]: Spent 18.47s on a formula simplification that was a NOOP. DAG size: 762 [2021-11-03 22:02:02,059 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-03 22:02:02,060 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 22:02:02,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664422081] [2021-11-03 22:02:02,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664422081] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 22:02:02,060 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 22:02:02,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 12] imperfect sequences [] total 19 [2021-11-03 22:02:02,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101094057] [2021-11-03 22:02:02,060 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 22:02:02,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-03 22:02:02,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 22:02:02,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-03 22:02:02,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=124, Unknown=8, NotChecked=162, Total=342 [2021-11-03 22:02:02,061 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 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-03 22:02:04,263 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 22:02:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 22:02:23,609 INFO L93 Difference]: Finished difference Result 242 states and 281 transitions. [2021-11-03 22:02:23,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 22:02:23,610 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 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 52 [2021-11-03 22:02:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 22:02:23,611 INFO L225 Difference]: With dead ends: 242 [2021-11-03 22:02:23,611 INFO L226 Difference]: Without dead ends: 149 [2021-11-03 22:02:23,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 39004.52ms TimeCoverageRelationStatistics Valid=82, Invalid=203, Unknown=11, NotChecked=210, Total=506 [2021-11-03 22:02:23,612 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6673.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.91ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1206 IncrementalHoareTripleChecker+Unchecked, 7375.13ms IncrementalHoareTripleChecker+Time [2021-11-03 22:02:23,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 2014 Unknown, 0 Unchecked, 12.91ms Time], IncrementalHoareTripleChecker [15 Valid, 792 Invalid, 1 Unknown, 1206 Unchecked, 7375.13ms Time] [2021-11-03 22:02:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-11-03 22:02:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2021-11-03 22:02:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 128 states have (on average 1.2109375) internal successors, (155), 134 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-03 22:02:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2021-11-03 22:02:23,617 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 52 [2021-11-03 22:02:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 22:02:23,617 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2021-11-03 22:02:23,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 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-03 22:02:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2021-11-03 22:02:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-03 22:02:23,618 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 22:02:23,618 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] [2021-11-03 22:02:23,787 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-03 22:02:23,831 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-03 22:02:23,832 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 22:02:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 22:02:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash 992366018, now seen corresponding path program 1 times [2021-11-03 22:02:23,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 22:02:23,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673969345] [2021-11-03 22:02:23,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 22:02:23,836 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 22:02:23,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 22:02:23,837 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-03 22:02:23,838 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-03 22:03:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 22:03:57,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 1523 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-03 22:03:57,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 22:03:57,835 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-03 22:03:58,193 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-03 22:03:58,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2021-11-03 22:03:58,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-11-03 22:03:58,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 22:03:58,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2021-11-03 22:03:59,040 INFO L354 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2021-11-03 22:03:59,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2021-11-03 22:03:59,301 INFO L354 Elim1Store]: treesize reduction 105, result has 7.9 percent of original size [2021-11-03 22:03:59,301 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 2 case distinctions, treesize of input 51 treesize of output 22 [2021-11-03 22:03:59,695 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-03 22:03:59,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 22:04:12,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62| (_ BitVec 64)) (v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62|)))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4)) c_ULTIMATE.start_aws_array_list_is_valid_~list.base) (bvadd c_ULTIMATE.start_aws_array_list_is_valid_~list.offset (_ bv32 64))))))) is different from false [2021-11-03 22:04:14,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62| (_ BitVec 64)) (v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62|)))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4)) |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.base|) (bvadd |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.offset| (_ bv32 64))))))) is different from false [2021-11-03 22:04:16,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62| (_ BitVec 64)) (v_DerPreprocessor_4 (_ BitVec 64)) (ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ BitVec 64)) (v_DerPreprocessor_3 (_ BitVec 64)) (|ULTIMATE.start_ensure_array_list_has_allocated_data_member_#t~ite589.base| (_ BitVec 64))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.base) c_ULTIMATE.start_ensure_array_list_has_allocated_data_member_~list.offset |ULTIMATE.start_ensure_array_list_has_allocated_data_member_#t~ite589.base|)))) (store .cse0 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62| (store (store (select .cse0 |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62|) ULTIMATE.start_aws_mul_u64_checked_~r.offset v_DerPreprocessor_3) (bvadd ULTIMATE.start_aws_mul_u64_checked_~r.offset (_ bv4 64)) v_DerPreprocessor_4))) |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.base|) (bvadd |c_ULTIMATE.start_aws_array_list_clear_harness_~#list~0.offset| (_ bv32 64))) (_ bv0 64))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_aws_array_list_is_valid_~#required_size~0.base_62|)))))) is different from false [2021-11-03 22:04:16,607 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 3470 treesize of output 3422 [2021-11-03 22:04:18,736 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-03 22:04:18,737 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-03 22:04:18,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673969345] [2021-11-03 22:04:18,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673969345] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 22:04:18,737 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 22:04:18,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 20 [2021-11-03 22:04:18,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204689291] [2021-11-03 22:04:18,737 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-03 22:04:18,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-03 22:04:18,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-03 22:04:18,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-03 22:04:18,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=213, Unknown=8, NotChecked=96, Total=380 [2021-11-03 22:04:18,738 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 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-03 22:04:20,929 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 22:04:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 22:04:53,807 INFO L93 Difference]: Finished difference Result 256 states and 296 transitions. [2021-11-03 22:04:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-03 22:04:53,807 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 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 52 [2021-11-03 22:04:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 22:04:53,808 INFO L225 Difference]: With dead ends: 256 [2021-11-03 22:04:53,808 INFO L226 Difference]: Without dead ends: 167 [2021-11-03 22:04:53,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 47083.23ms TimeCoverageRelationStatistics Valid=135, Invalid=508, Unknown=19, NotChecked=150, Total=812 [2021-11-03 22:04:53,809 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5259.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.31ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 997 IncrementalHoareTripleChecker+Unchecked, 5692.90ms IncrementalHoareTripleChecker+Time [2021-11-03 22:04:53,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 1687 Unknown, 0 Unchecked, 8.31ms Time], IncrementalHoareTripleChecker [17 Valid, 672 Invalid, 1 Unknown, 997 Unchecked, 5692.90ms Time] [2021-11-03 22:04:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-03 22:04:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2021-11-03 22:04:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 138 states have (on average 1.210144927536232) internal successors, (167), 144 states have internal predecessors, (167), 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-03 22:04:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2021-11-03 22:04:53,814 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 52 [2021-11-03 22:04:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 22:04:53,814 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2021-11-03 22:04:53,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 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-03 22:04:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2021-11-03 22:04:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-03 22:04:53,814 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 22:04:53,815 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] [2021-11-03 22:04:53,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-03 22:04:54,015 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-03 22:04:54,016 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-03 22:04:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 22:04:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1495014567, now seen corresponding path program 1 times [2021-11-03 22:04:54,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-03 22:04:54,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685552697] [2021-11-03 22:04:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 22:04:54,019 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 22:04:54,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-03 22:04:54,020 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-03 22:04:54,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process Killed by 15