./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_list_get_at_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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_get_at_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 4074842a6d6900f214884b5b0ef94aa1b36f37c81b70cefd0198f88d1e717beb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 20:01:40,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 20:01:40,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 20:01:40,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 20:01:40,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 20:01:40,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 20:01:40,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 20:01:40,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 20:01:40,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 20:01:40,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 20:01:40,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 20:01:40,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 20:01:40,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 20:01:40,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 20:01:40,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 20:01:40,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 20:01:40,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 20:01:40,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 20:01:40,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 20:01:40,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 20:01:40,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 20:01:40,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 20:01:40,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 20:01:40,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 20:01:40,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 20:01:40,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 20:01:40,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 20:01:40,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 20:01:40,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 20:01:40,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 20:01:40,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 20:01:40,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 20:01:40,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 20:01:40,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 20:01:40,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 20:01:40,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 20:01:40,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 20:01:40,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 20:01:40,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 20:01:40,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 20:01:40,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 20:01:40,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 20:01:40,635 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 20:01:40,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 20:01:40,642 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 20:01:40,642 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 20:01:40,642 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 20:01:40,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 20:01:40,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 20:01:40,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 20:01:40,643 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 20:01:40,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 20:01:40,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 20:01:40,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 20:01:40,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 20:01:40,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 20:01:40,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 20:01:40,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 20:01:40,645 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 20:01:40,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 20:01:40,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 20:01:40,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 20:01:40,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 20:01:40,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:01:40,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 20:01:40,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 20:01:40,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 20:01:40,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 20:01:40,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 20:01:40,648 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 20:01:40,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 20:01:40,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 20:01:40,648 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 20:01:40,648 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 -> 4074842a6d6900f214884b5b0ef94aa1b36f37c81b70cefd0198f88d1e717beb [2021-11-16 20:01:40,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 20:01:40,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 20:01:40,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 20:01:40,866 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 20:01:40,866 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 20:01:40,867 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_get_at_harness.i [2021-11-16 20:01:40,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a588a5235/085dc1ad977e456994038ba0c07f23f9/FLAG6c78d3b8b [2021-11-16 20:01:41,489 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 20:01:41,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_get_at_harness.i [2021-11-16 20:01:41,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a588a5235/085dc1ad977e456994038ba0c07f23f9/FLAG6c78d3b8b [2021-11-16 20:01:41,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a588a5235/085dc1ad977e456994038ba0c07f23f9 [2021-11-16 20:01:41,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 20:01:41,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 20:01:41,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 20:01:41,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 20:01:41,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 20:01:41,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:01:41" (1/1) ... [2021-11-16 20:01:41,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443c8897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:41, skipping insertion in model container [2021-11-16 20:01:41,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:01:41" (1/1) ... [2021-11-16 20:01:41,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 20:01:41,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 20:01:42,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_get_at_harness.i[4495,4508] [2021-11-16 20:01:42,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_get_at_harness.i[4555,4568] [2021-11-16 20:01:42,180 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:01:42,187 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:01:42,571 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:01:42,630 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,635 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,636 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,637 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,638 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,646 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,647 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,648 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,650 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,651 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,652 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,652 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,653 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,843 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:01:42,844 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:01:42,845 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:01:42,845 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:01:42,846 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:01:42,847 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:01:42,847 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:01:42,847 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:01:42,848 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:01:42,848 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:01:42,936 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,951 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,977 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,978 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:42,979 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:01:43,009 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 20:01:43,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_get_at_harness.i[4495,4508] [2021-11-16 20:01:43,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_get_at_harness.i[4555,4568] [2021-11-16 20:01:43,019 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:01:43,020 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:01:43,048 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:01:43,059 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,061 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,064 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,065 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,066 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,070 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,073 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,076 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,077 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,079 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,079 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,080 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,080 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,108 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:01:43,109 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:01:43,109 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:01:43,110 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:01:43,110 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:01:43,112 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:01:43,113 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:01:43,113 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:01:43,113 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:01:43,114 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:01:43,161 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,168 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,186 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,190 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:01:43,191 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:01:43,342 INFO L208 MainTranslator]: Completed translation [2021-11-16 20:01:43,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43 WrapperNode [2021-11-16 20:01:43,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 20:01:43,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 20:01:43,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 20:01:43,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 20:01:43,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43" (1/1) ... [2021-11-16 20:01:43,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43" (1/1) ... [2021-11-16 20:01:43,476 INFO L137 Inliner]: procedures = 693, calls = 1684, calls flagged for inlining = 53, calls inlined = 9, statements flattened = 652 [2021-11-16 20:01:43,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 20:01:43,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 20:01:43,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 20:01:43,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 20:01:43,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43" (1/1) ... [2021-11-16 20:01:43,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43" (1/1) ... [2021-11-16 20:01:43,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43" (1/1) ... [2021-11-16 20:01:43,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43" (1/1) ... [2021-11-16 20:01:43,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43" (1/1) ... [2021-11-16 20:01:43,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43" (1/1) ... [2021-11-16 20:01:43,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43" (1/1) ... [2021-11-16 20:01:43,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 20:01:43,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 20:01:43,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 20:01:43,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 20:01:43,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43" (1/1) ... [2021-11-16 20:01:43,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:01:43,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:01:43,593 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-16 20:01:43,596 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-16 20:01:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 20:01:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2021-11-16 20:01:43,633 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2021-11-16 20:01:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2021-11-16 20:01:43,634 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2021-11-16 20:01:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 20:01:43,634 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 20:01:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 20:01:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-11-16 20:01:43,634 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-11-16 20:01:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 20:01:43,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 20:01:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 20:01:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 20:01:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 20:01:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2021-11-16 20:01:43,636 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2021-11-16 20:01:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 20:01:43,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 20:01:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 20:01:43,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 20:01:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2021-11-16 20:01:43,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2021-11-16 20:01:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-11-16 20:01:43,637 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-11-16 20:01:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-11-16 20:01:43,637 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-11-16 20:01:43,637 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2021-11-16 20:01:43,638 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2021-11-16 20:01:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 20:01:43,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 20:01:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2021-11-16 20:01:43,638 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2021-11-16 20:01:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 20:01:43,638 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-16 20:01:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 20:01:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 20:01:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 20:01:43,639 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 20:01:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-11-16 20:01:43,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-11-16 20:01:43,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 20:01:43,640 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2021-11-16 20:01:43,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2021-11-16 20:01:43,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 20:01:43,882 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 20:01:43,883 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 20:01:45,012 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 20:01:45,019 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 20:01:45,020 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-16 20:01:45,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:01:45 BoogieIcfgContainer [2021-11-16 20:01:45,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 20:01:45,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 20:01:45,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 20:01:45,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 20:01:45,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:01:41" (1/3) ... [2021-11-16 20:01:45,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cf7758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:01:45, skipping insertion in model container [2021-11-16 20:01:45,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:01:43" (2/3) ... [2021-11-16 20:01:45,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cf7758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:01:45, skipping insertion in model container [2021-11-16 20:01:45,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:01:45" (3/3) ... [2021-11-16 20:01:45,031 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_get_at_harness.i [2021-11-16 20:01:45,035 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 20:01:45,035 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 20:01:45,070 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 20:01:45,076 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-16 20:01:45,077 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 20:01:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 108 states have (on average 1.212962962962963) internal successors, (131), 109 states have internal predecessors, (131), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2021-11-16 20:01:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-16 20:01:45,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:01:45,099 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:01:45,099 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:01:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:01:45,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1881445885, now seen corresponding path program 1 times [2021-11-16 20:01:45,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:01:45,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152780443] [2021-11-16 20:01:45,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:45,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:01:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:01:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:01:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:01:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:01:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:01:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-16 20:01:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:01:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:01:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:01:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:01:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:01:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 20:01:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:01:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:01:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 20:01:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 20:01:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 20:01:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 20:01:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-16 20:01:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-16 20:01:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-11-16 20:01:45,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:01:45,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152780443] [2021-11-16 20:01:45,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152780443] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:01:45,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:01:45,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 20:01:45,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098146861] [2021-11-16 20:01:45,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:01:45,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:01:45,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:01:45,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:01:45,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:01:45,797 INFO L87 Difference]: Start difference. First operand has 178 states, 108 states have (on average 1.212962962962963) internal successors, (131), 109 states have internal predecessors, (131), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-16 20:01:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:01:46,315 INFO L93 Difference]: Finished difference Result 370 states and 533 transitions. [2021-11-16 20:01:46,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:01:46,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2021-11-16 20:01:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:01:46,324 INFO L225 Difference]: With dead ends: 370 [2021-11-16 20:01:46,324 INFO L226 Difference]: Without dead ends: 190 [2021-11-16 20:01:46,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:01:46,329 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 114 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-16 20:01:46,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 279 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-16 20:01:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-16 20:01:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 169. [2021-11-16 20:01:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 102 states have internal predecessors, (118), 52 states have call successors, (52), 16 states have call predecessors, (52), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-16 20:01:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 220 transitions. [2021-11-16 20:01:46,379 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 220 transitions. Word has length 124 [2021-11-16 20:01:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:01:46,379 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 220 transitions. [2021-11-16 20:01:46,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-16 20:01:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 220 transitions. [2021-11-16 20:01:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-16 20:01:46,383 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:01:46,383 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:01:46,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 20:01:46,383 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:01:46,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:01:46,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1730209477, now seen corresponding path program 1 times [2021-11-16 20:01:46,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:01:46,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172229034] [2021-11-16 20:01:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:46,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:01:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:01:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:01:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 20:01:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:01:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:01:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-16 20:01:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:01:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:01:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:01:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:01:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:01:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 20:01:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:01:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:01:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 20:01:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 20:01:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 20:01:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 20:01:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-16 20:01:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-16 20:01:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-11-16 20:01:46,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:01:46,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172229034] [2021-11-16 20:01:46,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172229034] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:01:46,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915793735] [2021-11-16 20:01:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:46,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:01:46,735 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-16 20:01:46,771 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-16 20:01:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:47,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 2213 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-16 20:01:47,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:01:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-11-16 20:01:47,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:01:47,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915793735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:01:47,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:01:47,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2021-11-16 20:01:47,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562417388] [2021-11-16 20:01:47,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:01:47,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:01:47,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:01:47,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:01:47,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:01:47,297 INFO L87 Difference]: Start difference. First operand 169 states and 220 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-11-16 20:01:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:01:47,482 INFO L93 Difference]: Finished difference Result 311 states and 411 transitions. [2021-11-16 20:01:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:01:47,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 124 [2021-11-16 20:01:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:01:47,503 INFO L225 Difference]: With dead ends: 311 [2021-11-16 20:01:47,503 INFO L226 Difference]: Without dead ends: 171 [2021-11-16 20:01:47,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:01:47,505 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 229 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:01:47,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 627 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:01:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-16 20:01:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-11-16 20:01:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 104 states have internal predecessors, (119), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (55), 50 states have call predecessors, (55), 50 states have call successors, (55) [2021-11-16 20:01:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 226 transitions. [2021-11-16 20:01:47,531 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 226 transitions. Word has length 124 [2021-11-16 20:01:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:01:47,533 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 226 transitions. [2021-11-16 20:01:47,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-11-16 20:01:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 226 transitions. [2021-11-16 20:01:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-16 20:01:47,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:01:47,537 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:01:47,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-16 20:01:47,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:47,742 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:01:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:01:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1300515237, now seen corresponding path program 1 times [2021-11-16 20:01:47,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:01:47,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112544429] [2021-11-16 20:01:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:47,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:01:47,785 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 20:01:47,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831999850] [2021-11-16 20:01:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:47,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:47,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:01:47,787 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-16 20:01:47,788 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-16 20:01:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:48,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 2455 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 20:01:48,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:01:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-11-16 20:01:48,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:01:48,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:01:48,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112544429] [2021-11-16 20:01:48,345 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 20:01:48,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831999850] [2021-11-16 20:01:48,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831999850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:01:48,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:01:48,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 20:01:48,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534769994] [2021-11-16 20:01:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:01:48,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:01:48,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:01:48,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:01:48,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:01:48,348 INFO L87 Difference]: Start difference. First operand 171 states and 226 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 20:01:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:01:48,549 INFO L93 Difference]: Finished difference Result 279 states and 368 transitions. [2021-11-16 20:01:48,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:01:48,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 154 [2021-11-16 20:01:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:01:48,551 INFO L225 Difference]: With dead ends: 279 [2021-11-16 20:01:48,551 INFO L226 Difference]: Without dead ends: 171 [2021-11-16 20:01:48,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:01:48,552 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 245 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:01:48,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 771 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:01:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-16 20:01:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-11-16 20:01:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 104 states have internal predecessors, (119), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 50 states have call predecessors, (52), 50 states have call successors, (52) [2021-11-16 20:01:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2021-11-16 20:01:48,570 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 154 [2021-11-16 20:01:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:01:48,571 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2021-11-16 20:01:48,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 20:01:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2021-11-16 20:01:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-16 20:01:48,572 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:01:48,572 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:01:48,609 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-16 20:01:48,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-16 20:01:48,791 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:01:48,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:01:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1091978033, now seen corresponding path program 2 times [2021-11-16 20:01:48,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:01:48,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412789385] [2021-11-16 20:01:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:48,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:01:48,820 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 20:01:48,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949835544] [2021-11-16 20:01:48,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 20:01:48,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:48,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:01:48,822 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-16 20:01:48,823 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-16 20:01:49,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 20:01:49,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:01:49,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 2576 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 20:01:49,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:01:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-11-16 20:01:50,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:01:50,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:01:50,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412789385] [2021-11-16 20:01:50,249 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 20:01:50,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949835544] [2021-11-16 20:01:50,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949835544] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:01:50,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:01:50,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:01:50,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302574019] [2021-11-16 20:01:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:01:50,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:01:50,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:01:50,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:01:50,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:01:50,252 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 5 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 5 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 20:01:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:01:50,546 INFO L93 Difference]: Finished difference Result 268 states and 345 transitions. [2021-11-16 20:01:50,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:01:50,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 5 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 5 states have call predecessors, (22), 4 states have call successors, (22) Word has length 169 [2021-11-16 20:01:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:01:50,548 INFO L225 Difference]: With dead ends: 268 [2021-11-16 20:01:50,548 INFO L226 Difference]: Without dead ends: 169 [2021-11-16 20:01:50,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:01:50,549 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 246 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:01:50,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 1056 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:01:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-11-16 20:01:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-11-16 20:01:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 102 states have internal predecessors, (117), 52 states have call successors, (52), 16 states have call predecessors, (52), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-16 20:01:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 219 transitions. [2021-11-16 20:01:50,559 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 219 transitions. Word has length 169 [2021-11-16 20:01:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:01:50,560 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 219 transitions. [2021-11-16 20:01:50,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 5 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 5 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 20:01:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 219 transitions. [2021-11-16 20:01:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-16 20:01:50,561 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:01:50,562 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:01:50,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-16 20:01:50,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:50,775 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:01:50,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:01:50,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1928427287, now seen corresponding path program 1 times [2021-11-16 20:01:50,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:01:50,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186418282] [2021-11-16 20:01:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:50,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:01:50,842 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 20:01:50,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789378774] [2021-11-16 20:01:50,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:50,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:50,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:01:50,843 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-16 20:01:50,844 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-16 20:01:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:51,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 2818 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-16 20:01:51,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:01:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-11-16 20:01:51,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:01:51,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:01:51,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186418282] [2021-11-16 20:01:51,631 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 20:01:51,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789378774] [2021-11-16 20:01:51,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789378774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:01:51,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:01:51,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:01:51,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345256118] [2021-11-16 20:01:51,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:01:51,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:01:51,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:01:51,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:01:51,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:01:51,633 INFO L87 Difference]: Start difference. First operand 169 states and 219 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2021-11-16 20:01:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:01:51,733 INFO L93 Difference]: Finished difference Result 329 states and 436 transitions. [2021-11-16 20:01:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:01:51,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) Word has length 199 [2021-11-16 20:01:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:01:51,737 INFO L225 Difference]: With dead ends: 329 [2021-11-16 20:01:51,737 INFO L226 Difference]: Without dead ends: 226 [2021-11-16 20:01:51,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:01:51,738 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 50 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:01:51,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 1664 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:01:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-16 20:01:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 188. [2021-11-16 20:01:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 114 states have internal predecessors, (131), 58 states have call successors, (58), 16 states have call predecessors, (58), 16 states have return successors, (57), 57 states have call predecessors, (57), 56 states have call successors, (57) [2021-11-16 20:01:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2021-11-16 20:01:51,751 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 199 [2021-11-16 20:01:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:01:51,751 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2021-11-16 20:01:51,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2021-11-16 20:01:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2021-11-16 20:01:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-16 20:01:51,753 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:01:51,753 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:01:51,785 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-16 20:01:51,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:51,960 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:01:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:01:51,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1634572583, now seen corresponding path program 1 times [2021-11-16 20:01:51,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:01:51,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190079937] [2021-11-16 20:01:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:51,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:01:52,027 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 20:01:52,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1357447625] [2021-11-16 20:01:52,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:52,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:52,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:01:52,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:01:52,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 20:01:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:52,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 2815 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-16 20:01:52,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:01:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-11-16 20:01:52,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:01:52,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:01:52,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190079937] [2021-11-16 20:01:52,810 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 20:01:52,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357447625] [2021-11-16 20:01:52,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357447625] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:01:52,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:01:52,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 20:01:52,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672327032] [2021-11-16 20:01:52,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:01:52,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:01:52,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:01:52,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:01:52,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:01:52,812 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2021-11-16 20:01:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:01:52,912 INFO L93 Difference]: Finished difference Result 339 states and 451 transitions. [2021-11-16 20:01:52,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:01:52,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 199 [2021-11-16 20:01:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:01:52,914 INFO L225 Difference]: With dead ends: 339 [2021-11-16 20:01:52,914 INFO L226 Difference]: Without dead ends: 230 [2021-11-16 20:01:52,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:01:52,915 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 43 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:01:52,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 1210 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:01:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-16 20:01:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 194. [2021-11-16 20:01:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 116 states have (on average 1.146551724137931) internal successors, (133), 117 states have internal predecessors, (133), 61 states have call successors, (61), 16 states have call predecessors, (61), 16 states have return successors, (60), 60 states have call predecessors, (60), 59 states have call successors, (60) [2021-11-16 20:01:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 254 transitions. [2021-11-16 20:01:52,928 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 254 transitions. Word has length 199 [2021-11-16 20:01:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:01:52,928 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 254 transitions. [2021-11-16 20:01:52,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2021-11-16 20:01:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2021-11-16 20:01:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-16 20:01:52,930 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:01:52,930 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:01:52,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-16 20:01:53,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:53,152 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:01:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:01:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1629353815, now seen corresponding path program 1 times [2021-11-16 20:01:53,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:01:53,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770210652] [2021-11-16 20:01:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:53,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:01:53,209 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 20:01:53,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610922505] [2021-11-16 20:01:53,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:53,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:01:53,224 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:01:53,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-16 20:01:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:53,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 2812 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-16 20:01:53,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:01:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-11-16 20:01:53,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:01:53,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:01:53,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770210652] [2021-11-16 20:01:53,866 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 20:01:53,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610922505] [2021-11-16 20:01:53,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610922505] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:01:53,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:01:53,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 20:01:53,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573764837] [2021-11-16 20:01:53,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:01:53,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:01:53,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:01:53,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:01:53,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:01:53,868 INFO L87 Difference]: Start difference. First operand 194 states and 254 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2021-11-16 20:01:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:01:53,937 INFO L93 Difference]: Finished difference Result 297 states and 385 transitions. [2021-11-16 20:01:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:01:53,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) Word has length 199 [2021-11-16 20:01:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:01:53,939 INFO L225 Difference]: With dead ends: 297 [2021-11-16 20:01:53,939 INFO L226 Difference]: Without dead ends: 169 [2021-11-16 20:01:53,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:01:53,940 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 2 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:01:53,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 769 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:01:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-11-16 20:01:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-11-16 20:01:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 102 states have internal predecessors, (114), 52 states have call successors, (52), 16 states have call predecessors, (52), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-16 20:01:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 216 transitions. [2021-11-16 20:01:53,948 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 216 transitions. Word has length 199 [2021-11-16 20:01:53,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:01:53,949 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 216 transitions. [2021-11-16 20:01:53,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2021-11-16 20:01:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 216 transitions. [2021-11-16 20:01:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-16 20:01:53,950 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:01:53,951 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:01:53,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-16 20:01:54,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:54,171 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:01:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:01:54,171 INFO L85 PathProgramCache]: Analyzing trace with hash 140333254, now seen corresponding path program 1 times [2021-11-16 20:01:54,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:01:54,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571282831] [2021-11-16 20:01:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:54,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:01:54,200 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 20:01:54,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275525959] [2021-11-16 20:01:54,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:01:54,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:01:54,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:01:54,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:01:54,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-16 20:01:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:01:55,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 2849 conjuncts, 327 conjunts are in the unsatisfiable core [2021-11-16 20:01:55,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:01:55,215 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-16 20:01:55,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-16 20:01:55,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-16 20:01:57,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-16 20:01:59,380 INFO L354 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2021-11-16 20:01:59,380 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 32 treesize of output 29 [2021-11-16 20:02:00,053 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-16 20:02:00,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 35 [2021-11-16 20:02:22,545 INFO L354 Elim1Store]: treesize reduction 82, result has 22.6 percent of original size [2021-11-16 20:02:22,545 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 51 treesize of output 65 [2021-11-16 20:02:22,952 INFO L354 Elim1Store]: treesize reduction 224, result has 20.0 percent of original size [2021-11-16 20:02:22,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 76 treesize of output 115 [2021-11-16 20:02:48,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 20:02:48,753 INFO L354 Elim1Store]: treesize reduction 58, result has 30.1 percent of original size [2021-11-16 20:02:48,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 121 [2021-11-16 20:02:48,954 INFO L354 Elim1Store]: treesize reduction 254, result has 9.3 percent of original size [2021-11-16 20:02:48,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 127 treesize of output 133 [2021-11-16 20:03:19,986 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-11-16 20:03:19,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:03:19,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571282831] [2021-11-16 20:03:19,986 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 20:03:19,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275525959] [2021-11-16 20:03:19,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-11-16 20:03:19,987 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:03:19,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-16 20:03:19,987 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-16 20:03:19,987 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-16 20:03:19,992 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 20:03:20,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-11-16 20:03:20,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-16 20:03:20,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:03:20,206 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2021-11-16 20:03:20,207 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 20:03:20,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:03:20 BoogieIcfgContainer [2021-11-16 20:03:20,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 20:03:20,237 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 20:03:20,237 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 20:03:20,237 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 20:03:20,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:01:45" (3/4) ... [2021-11-16 20:03:20,239 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-16 20:03:20,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 20:03:20,240 INFO L158 Benchmark]: Toolchain (without parser) took 98348.86ms. Allocated memory was 107.0MB in the beginning and 289.4MB in the end (delta: 182.5MB). Free memory was 71.1MB in the beginning and 190.8MB in the end (delta: -119.7MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2021-11-16 20:03:20,240 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 20:03:20,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1450.67ms. Allocated memory was 107.0MB in the beginning and 140.5MB in the end (delta: 33.6MB). Free memory was 70.9MB in the beginning and 95.0MB in the end (delta: -24.1MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2021-11-16 20:03:20,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.91ms. Allocated memory is still 140.5MB. Free memory was 95.0MB in the beginning and 86.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-16 20:03:20,241 INFO L158 Benchmark]: Boogie Preprocessor took 81.90ms. Allocated memory is still 140.5MB. Free memory was 86.6MB in the beginning and 80.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-16 20:03:20,242 INFO L158 Benchmark]: RCFGBuilder took 1455.15ms. Allocated memory was 140.5MB in the beginning and 190.8MB in the end (delta: 50.3MB). Free memory was 80.3MB in the beginning and 130.9MB in the end (delta: -50.6MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2021-11-16 20:03:20,242 INFO L158 Benchmark]: TraceAbstraction took 95213.48ms. Allocated memory was 190.8MB in the beginning and 289.4MB in the end (delta: 98.6MB). Free memory was 130.9MB in the beginning and 191.8MB in the end (delta: -60.9MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2021-11-16 20:03:20,242 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 289.4MB. Free memory was 191.8MB in the beginning and 190.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-16 20:03:20,246 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.15ms. Allocated memory is still 107.0MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1450.67ms. Allocated memory was 107.0MB in the beginning and 140.5MB in the end (delta: 33.6MB). Free memory was 70.9MB in the beginning and 95.0MB in the end (delta: -24.1MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 139.91ms. Allocated memory is still 140.5MB. Free memory was 95.0MB in the beginning and 86.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.90ms. Allocated memory is still 140.5MB. Free memory was 86.6MB in the beginning and 80.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1455.15ms. Allocated memory was 140.5MB in the beginning and 190.8MB in the end (delta: 50.3MB). Free memory was 80.3MB in the beginning and 130.9MB in the end (delta: -50.6MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * TraceAbstraction took 95213.48ms. Allocated memory was 190.8MB in the beginning and 289.4MB in the end (delta: 98.6MB). Free memory was 130.9MB in the beginning and 191.8MB in the end (delta: -60.9MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 289.4MB. Free memory was 191.8MB in the beginning and 190.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 7786. 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, }; [L7359] static __thread int tl_last_error = 0; [L7785-L7933] 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", } , }; [L7936-L7939] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7941-L7950] 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.") } , }; [L7952-L7955] 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])), }; [L7957-L7961] static _Bool s_common_library_initialized = 0 ; [L8008] CALL aws_array_list_get_at_harness() [L7975] struct aws_array_list list = {0, __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), __VERIFIER_nondet_ulong(), 0}; [L7978] CALL, EXPR aws_array_list_is_bounded(&list, 9223372036854775808U, 2) [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; [L7978] RET, EXPR aws_array_list_is_bounded(&list, 9223372036854775808U, 2) [L7978] CALL assume_abort_if_not(aws_array_list_is_bounded(&list, 9223372036854775808U, 2)) [L211] COND FALSE !(!cond) [L7978] RET assume_abort_if_not(aws_array_list_is_bounded(&list, 9223372036854775808U, 2)) [L7979] CALL ensure_array_list_has_allocated_data_member(&list) [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] EXPR list->data [L7014-L7016] CALL assume_abort_if_not(list->data == ((void *)0) ) [L211] COND FALSE !(!cond) [L7014-L7016] RET assume_abort_if_not(list->data == ((void *)0) ) [L7017] CALL, EXPR can_fail_allocator() [L2786] return &s_can_fail_allocator_static; [L7017] RET, EXPR can_fail_allocator() [L7017] list->alloc = can_fail_allocator() [L7979] RET ensure_array_list_has_allocated_data_member(&list) [L7980] CALL, EXPR aws_array_list_is_valid(&list) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L3272] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3272] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [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; [L7980] RET, EXPR aws_array_list_is_valid(&list) [L7980] CALL assume_abort_if_not(aws_array_list_is_valid(&list)) [L211] COND FALSE !(!cond) [L7980] RET assume_abort_if_not(aws_array_list_is_valid(&list)) [L7981] size_t malloc_size; [L7982] EXPR list.item_size [L7982] CALL assume_abort_if_not(malloc_size <= list.item_size) [L211] COND FALSE !(!cond) [L7982] RET assume_abort_if_not(malloc_size <= list.item_size) [L7983] CALL, EXPR can_fail_malloc(malloc_size) [L2796] CALL, EXPR nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L2796] RET, EXPR nondet_bool() [L2796-L2798] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L2798] CALL, EXPR bounded_malloc(size) [L2779-L2781] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L211] COND FALSE !(!cond) [L2779-L2781] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L2782] return malloc(size); [L2798] RET, EXPR bounded_malloc(size) [L2796-L2798] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L2796-L2798] return nondet_bool() ? ((void *)0) : bounded_malloc(size); [L7983] RET, EXPR can_fail_malloc(malloc_size) [L7983] void *val = can_fail_malloc(malloc_size); [L7984] size_t index; [L7987] struct aws_array_list old = list; [L7988] struct store_byte_from_buffer old_byte; [L7989] EXPR list.data [L7989] EXPR list.current_size [L7989] CALL save_byte_from_array((uint8_t *)list.data, list.current_size, &old_byte) [L7183] COND FALSE !(size > 0 && array && storage) [L7989] RET save_byte_from_array((uint8_t *)list.data, list.current_size, &old_byte) [L7992] CALL, EXPR aws_array_list_is_valid(&list) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L3272] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3272] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [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; [L7992] RET, EXPR aws_array_list_is_valid(&list) [L7992] CALL assume_abort_if_not(aws_array_list_is_valid(&list)) [L211] COND FALSE !(!cond) [L7992] RET assume_abort_if_not(aws_array_list_is_valid(&list)) [L7993] EXPR val && ((((list.item_size)) == 0) || ((val))) [L7993] EXPR list.item_size [L7993] EXPR val && ((((list.item_size)) == 0) || ((val))) [L7993] CALL assume_abort_if_not(val && ((((list.item_size)) == 0) || ((val)))) [L211] COND FALSE !(!cond) [L7993] RET assume_abort_if_not(val && ((((list.item_size)) == 0) || ((val)))) [L7996] CALL aws_array_list_get_at(&list, val, index) [L3502] CALL, EXPR aws_array_list_is_valid(list) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L3272] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3272] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [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; [L3502] RET, EXPR aws_array_list_is_valid(list) [L3502] CALL assume_abort_if_not((aws_array_list_is_valid(list))) [L211] COND FALSE !(!cond) [L3502] RET assume_abort_if_not((aws_array_list_is_valid(list))) [L3503] EXPR val && ((((list->item_size)) == 0) || ((val))) [L3503] EXPR list->item_size [L3503] EXPR val && ((((list->item_size)) == 0) || ((val))) [L3503] CALL assume_abort_if_not((val && ((((list->item_size)) == 0) || ((val))))) [L211] COND FALSE !(!cond) [L3503] RET assume_abort_if_not((val && ((((list->item_size)) == 0) || ((val))))) [L3506] CALL aws_array_list_length(list) [L3493] EXPR list->length [L3493] EXPR !list->length || list->data [L3493] CALL assume_abort_if_not((!list->length || list->data)) [L211] COND FALSE !(!cond) [L3493] RET assume_abort_if_not((!list->length || list->data)) [L3494] CALL, EXPR aws_array_list_is_valid(list) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L3272] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3272] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [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; [L3494] RET, EXPR aws_array_list_is_valid(list) [L3494] CALL assume_abort_if_not((aws_array_list_is_valid(list))) [L211] COND FALSE !(!cond) [L3494] RET assume_abort_if_not((aws_array_list_is_valid(list))) [L3495] EXPR list->length [L3495] size_t len = list->length; [L3496] CALL, EXPR aws_array_list_is_valid(list) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L3272] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3272] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [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; [L3496] RET, EXPR aws_array_list_is_valid(list) [L3496] CALL __VERIFIER_assert((aws_array_list_is_valid(list))) [L223] COND TRUE !cond [L223] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 178 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 95.1s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 951 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 929 mSDsluCounter, 6376 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4959 mSDsCounter, 456 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1005 IncrementalHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 456 mSolverCounterUnsat, 1417 mSDtfsCounter, 1005 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1157 GetRequests, 1100 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=6, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 95 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 87.3s InterpolantComputationTime, 1502 NumberOfCodeBlocks, 1502 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1284 ConstructedInterpolants, 0 QuantifiedInterpolants, 1869 SizeOfPredicates, 24 NumberOfNonLiveVariables, 18538 ConjunctsInSsa, 407 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 2258/2270 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 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_get_at_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 4074842a6d6900f214884b5b0ef94aa1b36f37c81b70cefd0198f88d1e717beb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 20:03:21,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 20:03:21,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 20:03:21,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 20:03:21,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 20:03:21,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 20:03:21,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 20:03:21,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 20:03:21,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 20:03:21,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 20:03:21,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 20:03:21,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 20:03:21,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 20:03:21,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 20:03:21,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 20:03:21,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 20:03:21,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 20:03:21,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 20:03:21,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 20:03:21,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 20:03:21,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 20:03:21,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 20:03:21,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 20:03:21,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 20:03:21,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 20:03:21,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 20:03:21,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 20:03:21,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 20:03:21,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 20:03:21,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 20:03:21,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 20:03:21,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 20:03:21,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 20:03:21,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 20:03:21,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 20:03:21,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 20:03:21,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 20:03:21,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 20:03:21,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 20:03:21,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 20:03:21,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 20:03:21,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-16 20:03:21,929 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 20:03:21,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 20:03:21,930 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 20:03:21,930 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 20:03:21,930 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 20:03:21,931 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 20:03:21,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 20:03:21,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 20:03:21,932 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 20:03:21,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 20:03:21,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 20:03:21,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 20:03:21,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 20:03:21,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 20:03:21,933 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-16 20:03:21,933 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-16 20:03:21,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 20:03:21,933 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 20:03:21,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 20:03:21,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 20:03:21,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 20:03:21,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 20:03:21,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:03:21,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 20:03:21,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 20:03:21,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 20:03:21,944 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-16 20:03:21,945 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-16 20:03:21,945 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 20:03:21,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 20:03:21,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 20:03:21,945 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 20:03:21,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-16 20:03:21,946 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 -> 4074842a6d6900f214884b5b0ef94aa1b36f37c81b70cefd0198f88d1e717beb [2021-11-16 20:03:22,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 20:03:22,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 20:03:22,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 20:03:22,203 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 20:03:22,203 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 20:03:22,204 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_get_at_harness.i [2021-11-16 20:03:22,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f91a887/89afb314a1114acc809e6eb88453936f/FLAG72a4609a5 [2021-11-16 20:03:22,856 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 20:03:22,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_get_at_harness.i [2021-11-16 20:03:22,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f91a887/89afb314a1114acc809e6eb88453936f/FLAG72a4609a5 [2021-11-16 20:03:23,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f91a887/89afb314a1114acc809e6eb88453936f [2021-11-16 20:03:23,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 20:03:23,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 20:03:23,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 20:03:23,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 20:03:23,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 20:03:23,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:03:23" (1/1) ... [2021-11-16 20:03:23,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c203277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:23, skipping insertion in model container [2021-11-16 20:03:23,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:03:23" (1/1) ... [2021-11-16 20:03:23,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 20:03:23,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 20:03:23,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_get_at_harness.i[4495,4508] [2021-11-16 20:03:23,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_get_at_harness.i[4555,4568] [2021-11-16 20:03:23,280 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:03:23,284 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:03:23,762 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:03:23,816 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,820 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,820 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,823 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,825 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,831 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,837 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,838 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,839 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,839 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,840 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,840 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:23,841 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,034 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:03:24,035 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:03:24,036 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:03:24,036 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:03:24,037 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:03:24,038 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:03:24,039 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:03:24,039 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:03:24,039 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:03:24,040 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:03:24,139 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,151 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,190 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,191 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,192 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:03:24,229 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 20:03:24,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_get_at_harness.i[4495,4508] [2021-11-16 20:03:24,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_get_at_harness.i[4555,4568] [2021-11-16 20:03:24,239 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:03:24,239 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:03:24,254 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:03:24,261 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,261 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,262 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,262 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,262 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,266 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,266 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,266 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,267 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,267 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,268 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,268 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,268 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,294 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:03:24,295 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:03:24,295 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:03:24,295 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:03:24,296 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:03:24,296 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:03:24,297 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:03:24,297 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:03:24,297 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:03:24,298 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:03:24,312 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,315 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,327 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,328 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:03:24,328 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:03:24,468 INFO L208 MainTranslator]: Completed translation [2021-11-16 20:03:24,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24 WrapperNode [2021-11-16 20:03:24,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 20:03:24,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 20:03:24,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 20:03:24,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 20:03:24,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24" (1/1) ... [2021-11-16 20:03:24,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24" (1/1) ... [2021-11-16 20:03:24,601 INFO L137 Inliner]: procedures = 713, calls = 1684, calls flagged for inlining = 53, calls inlined = 9, statements flattened = 649 [2021-11-16 20:03:24,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 20:03:24,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 20:03:24,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 20:03:24,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 20:03:24,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24" (1/1) ... [2021-11-16 20:03:24,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24" (1/1) ... [2021-11-16 20:03:24,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24" (1/1) ... [2021-11-16 20:03:24,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24" (1/1) ... [2021-11-16 20:03:24,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24" (1/1) ... [2021-11-16 20:03:24,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24" (1/1) ... [2021-11-16 20:03:24,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24" (1/1) ... [2021-11-16 20:03:24,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 20:03:24,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 20:03:24,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 20:03:24,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 20:03:24,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24" (1/1) ... [2021-11-16 20:03:24,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:03:24,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:03:24,730 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-16 20:03:24,756 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-16 20:03:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 20:03:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2021-11-16 20:03:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2021-11-16 20:03:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2021-11-16 20:03:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2021-11-16 20:03:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 20:03:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 20:03:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-16 20:03:24,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-16 20:03:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-16 20:03:24,778 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-11-16 20:03:24,778 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-11-16 20:03:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 20:03:24,779 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 20:03:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 20:03:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 20:03:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 20:03:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2021-11-16 20:03:24,779 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2021-11-16 20:03:24,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 20:03:24,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 20:03:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 20:03:24,780 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 20:03:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-16 20:03:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2021-11-16 20:03:24,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2021-11-16 20:03:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-16 20:03:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-11-16 20:03:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-11-16 20:03:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-11-16 20:03:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-11-16 20:03:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2021-11-16 20:03:24,782 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2021-11-16 20:03:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 20:03:24,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 20:03:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2021-11-16 20:03:24,782 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2021-11-16 20:03:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 20:03:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-16 20:03:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 20:03:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-16 20:03:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-16 20:03:24,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 20:03:24,791 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 20:03:24,791 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 20:03:24,791 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-11-16 20:03:24,791 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-11-16 20:03:24,792 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2021-11-16 20:03:24,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2021-11-16 20:03:25,004 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 20:03:25,006 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 20:03:27,751 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 20:03:27,759 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 20:03:27,760 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-16 20:03:27,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:03:27 BoogieIcfgContainer [2021-11-16 20:03:27,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 20:03:27,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 20:03:27,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 20:03:27,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 20:03:27,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:03:23" (1/3) ... [2021-11-16 20:03:27,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c63f8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:03:27, skipping insertion in model container [2021-11-16 20:03:27,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:03:24" (2/3) ... [2021-11-16 20:03:27,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c63f8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:03:27, skipping insertion in model container [2021-11-16 20:03:27,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:03:27" (3/3) ... [2021-11-16 20:03:27,765 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_get_at_harness.i [2021-11-16 20:03:27,768 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 20:03:27,768 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 20:03:27,808 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 20:03:27,818 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-16 20:03:27,818 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 20:03:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 108 states have (on average 1.212962962962963) internal successors, (131), 109 states have internal predecessors, (131), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2021-11-16 20:03:27,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-16 20:03:27,844 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:03:27,844 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:03:27,845 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:03:27,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:03:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1881445885, now seen corresponding path program 1 times [2021-11-16 20:03:27,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:03:27,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292006970] [2021-11-16 20:03:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:03:27,859 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:03:27,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:03:27,861 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-16 20:03:27,862 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-16 20:03:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:03:28,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-16 20:03:28,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:03:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-11-16 20:03:28,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:03:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2021-11-16 20:03:28,742 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:03:28,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292006970] [2021-11-16 20:03:28,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292006970] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:03:28,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:03:28,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2021-11-16 20:03:28,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246935126] [2021-11-16 20:03:28,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:03:28,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 20:03:28,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:03:28,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 20:03:28,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 20:03:28,765 INFO L87 Difference]: Start difference. First operand has 178 states, 108 states have (on average 1.212962962962963) internal successors, (131), 109 states have internal predecessors, (131), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-16 20:03:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:03:28,793 INFO L93 Difference]: Finished difference Result 349 states and 497 transitions. [2021-11-16 20:03:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 20:03:28,794 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2021-11-16 20:03:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:03:28,800 INFO L225 Difference]: With dead ends: 349 [2021-11-16 20:03:28,801 INFO L226 Difference]: Without dead ends: 169 [2021-11-16 20:03:28,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 20:03:28,806 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:03:28,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:03:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-11-16 20:03:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-11-16 20:03:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 102 states have internal predecessors, (118), 52 states have call successors, (52), 16 states have call predecessors, (52), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-16 20:03:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 220 transitions. [2021-11-16 20:03:28,839 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 220 transitions. Word has length 124 [2021-11-16 20:03:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:03:28,839 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 220 transitions. [2021-11-16 20:03:28,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-16 20:03:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 220 transitions. [2021-11-16 20:03:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-16 20:03:28,842 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:03:28,842 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:03:28,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-16 20:03:29,061 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-16 20:03:29,061 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:03:29,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:03:29,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1730209477, now seen corresponding path program 1 times [2021-11-16 20:03:29,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:03:29,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076672485] [2021-11-16 20:03:29,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:03:29,063 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:03:29,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:03:29,065 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-16 20:03:29,066 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-16 20:03:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:03:29,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-16 20:03:29,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:03:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-11-16 20:03:29,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:03:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-11-16 20:03:29,911 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:03:29,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076672485] [2021-11-16 20:03:29,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076672485] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:03:29,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:03:29,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-11-16 20:03:29,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300331525] [2021-11-16 20:03:29,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:03:29,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:03:29,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:03:29,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:03:29,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:03:29,914 INFO L87 Difference]: Start difference. First operand 169 states and 220 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-11-16 20:03:30,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:03:30,127 INFO L93 Difference]: Finished difference Result 311 states and 411 transitions. [2021-11-16 20:03:30,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:03:30,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 124 [2021-11-16 20:03:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:03:30,130 INFO L225 Difference]: With dead ends: 311 [2021-11-16 20:03:30,130 INFO L226 Difference]: Without dead ends: 171 [2021-11-16 20:03:30,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:03:30,132 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 49 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:03:30,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 712 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:03:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-16 20:03:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-11-16 20:03:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 104 states have internal predecessors, (119), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (55), 50 states have call predecessors, (55), 50 states have call successors, (55) [2021-11-16 20:03:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 226 transitions. [2021-11-16 20:03:30,144 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 226 transitions. Word has length 124 [2021-11-16 20:03:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:03:30,144 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 226 transitions. [2021-11-16 20:03:30,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-11-16 20:03:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 226 transitions. [2021-11-16 20:03:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-16 20:03:30,146 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:03:30,146 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:03:30,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-16 20:03:30,360 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-16 20:03:30,360 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:03:30,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:03:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1300515237, now seen corresponding path program 1 times [2021-11-16 20:03:30,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:03:30,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396382386] [2021-11-16 20:03:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:03:30,363 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:03:30,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:03:30,364 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-16 20:03:30,365 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-16 20:03:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:03:30,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-16 20:03:30,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:03:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-11-16 20:03:31,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:03:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-11-16 20:03:31,557 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:03:31,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396382386] [2021-11-16 20:03:31,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396382386] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 20:03:31,557 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:03:31,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-11-16 20:03:31,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578730320] [2021-11-16 20:03:31,557 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 20:03:31,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:03:31,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:03:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:03:31,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:03:31,559 INFO L87 Difference]: Start difference. First operand 171 states and 226 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2021-11-16 20:03:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:03:31,659 INFO L93 Difference]: Finished difference Result 339 states and 463 transitions. [2021-11-16 20:03:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:03:31,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) Word has length 154 [2021-11-16 20:03:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:03:31,662 INFO L225 Difference]: With dead ends: 339 [2021-11-16 20:03:31,662 INFO L226 Difference]: Without dead ends: 228 [2021-11-16 20:03:31,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:03:31,663 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 29 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:03:31,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 1457 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:03:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-11-16 20:03:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 184. [2021-11-16 20:03:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 111 states have (on average 1.162162162162162) internal successors, (129), 113 states have internal predecessors, (129), 55 states have call successors, (55), 16 states have call predecessors, (55), 17 states have return successors, (59), 54 states have call predecessors, (59), 53 states have call successors, (59) [2021-11-16 20:03:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 243 transitions. [2021-11-16 20:03:31,680 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 243 transitions. Word has length 154 [2021-11-16 20:03:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:03:31,681 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 243 transitions. [2021-11-16 20:03:31,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2021-11-16 20:03:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 243 transitions. [2021-11-16 20:03:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-16 20:03:31,682 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:03:31,683 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:03:31,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-16 20:03:31,902 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-16 20:03:31,903 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:03:31,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:03:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash -424496231, now seen corresponding path program 1 times [2021-11-16 20:03:31,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:03:31,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573713189] [2021-11-16 20:03:31,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:03:31,906 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:03:31,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:03:31,907 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-16 20:03:31,908 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-16 20:03:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:03:32,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-16 20:03:32,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:03:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-11-16 20:03:32,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:03:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-11-16 20:03:33,224 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:03:33,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573713189] [2021-11-16 20:03:33,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573713189] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:03:33,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:03:33,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2021-11-16 20:03:33,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258580704] [2021-11-16 20:03:33,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:03:33,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:03:33,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:03:33,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:03:33,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:03:33,226 INFO L87 Difference]: Start difference. First operand 184 states and 243 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 20:03:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:03:33,510 INFO L93 Difference]: Finished difference Result 296 states and 393 transitions. [2021-11-16 20:03:33,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:03:33,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 154 [2021-11-16 20:03:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:03:33,512 INFO L225 Difference]: With dead ends: 296 [2021-11-16 20:03:33,512 INFO L226 Difference]: Without dead ends: 171 [2021-11-16 20:03:33,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:03:33,513 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 7 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:03:33,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1565 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:03:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-16 20:03:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-11-16 20:03:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 102 states have (on average 1.1470588235294117) internal successors, (117), 104 states have internal predecessors, (117), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (55), 50 states have call predecessors, (55), 50 states have call successors, (55) [2021-11-16 20:03:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 224 transitions. [2021-11-16 20:03:33,523 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 224 transitions. Word has length 154 [2021-11-16 20:03:33,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:03:33,523 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 224 transitions. [2021-11-16 20:03:33,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 20:03:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 224 transitions. [2021-11-16 20:03:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-16 20:03:33,525 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:03:33,525 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:03:33,559 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-16 20:03:33,743 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-16 20:03:33,743 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:03:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:03:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 806434654, now seen corresponding path program 1 times [2021-11-16 20:03:33,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:03:33,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934931221] [2021-11-16 20:03:33,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:03:33,746 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:03:33,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:03:33,758 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-16 20:03:33,759 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-16 20:03:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:03:34,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 20:03:34,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:03:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2021-11-16 20:03:34,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:03:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2021-11-16 20:03:34,976 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:03:34,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934931221] [2021-11-16 20:03:34,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934931221] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:03:34,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:03:34,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2021-11-16 20:03:34,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155495025] [2021-11-16 20:03:34,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:03:34,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:03:34,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:03:34,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:03:34,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:03:34,977 INFO L87 Difference]: Start difference. First operand 171 states and 224 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2021-11-16 20:03:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:03:35,237 INFO L93 Difference]: Finished difference Result 279 states and 366 transitions. [2021-11-16 20:03:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:03:35,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 165 [2021-11-16 20:03:35,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:03:35,241 INFO L225 Difference]: With dead ends: 279 [2021-11-16 20:03:35,241 INFO L226 Difference]: Without dead ends: 171 [2021-11-16 20:03:35,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:03:35,242 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 64 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:03:35,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 860 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:03:35,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-16 20:03:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-11-16 20:03:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 102 states have (on average 1.1470588235294117) internal successors, (117), 104 states have internal predecessors, (117), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 50 states have call predecessors, (52), 50 states have call successors, (52) [2021-11-16 20:03:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 221 transitions. [2021-11-16 20:03:35,250 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 221 transitions. Word has length 165 [2021-11-16 20:03:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:03:35,250 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 221 transitions. [2021-11-16 20:03:35,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2021-11-16 20:03:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 221 transitions. [2021-11-16 20:03:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-11-16 20:03:35,252 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:03:35,252 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:03:35,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-16 20:03:35,474 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-16 20:03:35,475 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:03:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:03:35,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1818508238, now seen corresponding path program 2 times [2021-11-16 20:03:35,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:03:35,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488057012] [2021-11-16 20:03:35,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 20:03:35,476 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:03:35,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:03:35,477 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-16 20:03:35,478 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-16 20:04:21,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 20:04:21,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:04:21,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 20:04:21,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:04:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2021-11-16 20:04:21,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:04:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2021-11-16 20:04:22,027 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 20:04:22,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488057012] [2021-11-16 20:04:22,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488057012] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 20:04:22,028 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:04:22,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2021-11-16 20:04:22,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072107214] [2021-11-16 20:04:22,028 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 20:04:22,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:04:22,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 20:04:22,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:04:22,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:04:22,029 INFO L87 Difference]: Start difference. First operand 171 states and 221 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 5 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2021-11-16 20:04:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:04:22,377 INFO L93 Difference]: Finished difference Result 268 states and 343 transitions. [2021-11-16 20:04:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:04:22,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 5 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) Word has length 180 [2021-11-16 20:04:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:04:22,379 INFO L225 Difference]: With dead ends: 268 [2021-11-16 20:04:22,379 INFO L226 Difference]: Without dead ends: 169 [2021-11-16 20:04:22,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:04:22,381 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 71 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:04:22,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 1381 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 20:04:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-11-16 20:04:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-11-16 20:04:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 102 states have internal predecessors, (115), 52 states have call successors, (52), 16 states have call predecessors, (52), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-16 20:04:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 217 transitions. [2021-11-16 20:04:22,395 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 217 transitions. Word has length 180 [2021-11-16 20:04:22,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:04:22,396 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 217 transitions. [2021-11-16 20:04:22,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 5 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2021-11-16 20:04:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 217 transitions. [2021-11-16 20:04:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-16 20:04:22,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:04:22,398 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:04:22,427 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-16 20:04:22,621 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-16 20:04:22,621 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:04:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:04:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash 140333254, now seen corresponding path program 1 times [2021-11-16 20:04:22,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 20:04:22,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432581334] [2021-11-16 20:04:22,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:04:22,623 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 20:04:22,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 20:04:22,624 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-16 20:04:22,625 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-16 20:05:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:05:15,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 1596 conjuncts, 243 conjunts are in the unsatisfiable core [2021-11-16 20:05:15,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:05:15,727 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-16 20:05:16,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2021-11-16 20:05:16,507 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 20:05:16,507 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 17 treesize of output 9 [2021-11-16 20:05:17,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:05:17,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:05:17,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:05:17,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:05:17,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:05:17,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:05:17,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:05:17,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:05:17,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:05:17,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:05:17,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2021-11-16 20:05:17,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2021-11-16 20:05:17,845 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 20:05:17,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 14 [2021-11-16 20:06:07,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:06:07,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:06:07,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:06:07,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:06:07,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:06:07,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:06:08,034 INFO L354 Elim1Store]: treesize reduction 379, result has 11.9 percent of original size [2021-11-16 20:06:08,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 155 treesize of output 119 [2021-11-16 20:06:08,114 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-16 20:06:08,114 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 156 treesize of output 157 [2021-11-16 20:06:38,714 INFO L354 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2021-11-16 20:06:38,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 212 [2021-11-16 20:07:23,847 INFO L354 Elim1Store]: treesize reduction 84, result has 32.8 percent of original size [2021-11-16 20:07:23,847 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 10 case distinctions, treesize of input 330 treesize of output 361 [2021-11-16 20:07:46,543 INFO L354 Elim1Store]: treesize reduction 277, result has 23.7 percent of original size [2021-11-16 20:07:46,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 438 treesize of output 505 [2021-11-16 20:11:07,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 20:11:07,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 20:11:07,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 20:11:07,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 20:11:07,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:11:07,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 20:11:07,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 20:11:14,347 WARN L227 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 760 DAG size of output: 36 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-16 20:11:14,348 INFO L354 Elim1Store]: treesize reduction 2952, result has 1.7 percent of original size [2021-11-16 20:11:14,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 30 select indices, 30 select index equivalence classes, 28 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 441 case distinctions, treesize of input 678 treesize of output 612 [2021-11-16 20:11:15,903 INFO L354 Elim1Store]: treesize reduction 399, result has 12.1 percent of original size [2021-11-16 20:11:15,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 679 treesize of output 710 Killed by 15