./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_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 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:50:10,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:50:10,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:50:10,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:50:10,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:50:10,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:50:10,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:50:10,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:50:10,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:50:10,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:50:10,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:50:10,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:50:10,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:50:10,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:50:10,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:50:10,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:50:10,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:50:10,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:50:10,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:50:10,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:50:10,711 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:50:10,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:50:10,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:50:10,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:50:10,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:50:10,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:50:10,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:50:10,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:50:10,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:50:10,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:50:10,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:50:10,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:50:10,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:50:10,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:50:10,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:50:10,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:50:10,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:50:10,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:50:10,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:50:10,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:50:10,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:50:10,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:50:10,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:50:10,753 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:50:10,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:50:10,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:50:10,754 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:50:10,755 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:50:10,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:50:10,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:50:10,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:50:10,756 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:50:10,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:50:10,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:50:10,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:50:10,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:50:10,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:50:10,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:50:10,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:50:10,757 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:50:10,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:50:10,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:50:10,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:50:10,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:50:10,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:50:10,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:50:10,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:50:10,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:50:10,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:50:10,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:50:10,759 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:50:10,759 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:50:10,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:50:10,759 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 -> 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 [2022-07-13 22:50:10,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:50:10,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:50:10,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:50:10,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:50:10,982 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:50:10,983 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2022-07-13 22:50:11,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a251af5/ffec174de1eb4d0995663499acaba55e/FLAG8e3349277 [2022-07-13 22:50:11,673 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:50:11,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2022-07-13 22:50:11,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a251af5/ffec174de1eb4d0995663499acaba55e/FLAG8e3349277 [2022-07-13 22:50:11,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a251af5/ffec174de1eb4d0995663499acaba55e [2022-07-13 22:50:11,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:50:11,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:50:11,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:50:11,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:50:11,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:50:11,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:50:11" (1/1) ... [2022-07-13 22:50:11,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ee9b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:11, skipping insertion in model container [2022-07-13 22:50:11,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:50:11" (1/1) ... [2022-07-13 22:50:11,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:50:11,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:50:12,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4495,4508] [2022-07-13 22:50:12,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4555,4568] [2022-07-13 22:50:12,944 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,944 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,945 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,945 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,946 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,954 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,954 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,956 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,958 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,963 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,964 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,965 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:12,965 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,282 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:50:13,283 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:50:13,284 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:50:13,284 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:50:13,285 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:50:13,286 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:50:13,286 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:50:13,287 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:50:13,287 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:50:13,288 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:50:13,401 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:50:13,653 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,654 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,677 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,679 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,687 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,688 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,703 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,704 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,706 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,706 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,707 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,707 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,707 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:50:13,778 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:50:13,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4495,4508] [2022-07-13 22:50:13,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4555,4568] [2022-07-13 22:50:13,829 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,829 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,830 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,830 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,830 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,838 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,838 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,839 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,839 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,840 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,840 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,840 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,840 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,862 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:50:13,863 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:50:13,864 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:50:13,865 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:50:13,865 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:50:13,865 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:50:13,866 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:50:13,866 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:50:13,866 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:50:13,867 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:50:13,887 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:50:13,996 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:13,996 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,001 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,002 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,004 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,004 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,013 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,014 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,014 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,015 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,015 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,016 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,016 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:14,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:50:14,222 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:50:14,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14 WrapperNode [2022-07-13 22:50:14,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:50:14,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:50:14,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:50:14,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:50:14,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14" (1/1) ... [2022-07-13 22:50:14,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14" (1/1) ... [2022-07-13 22:50:14,378 INFO L137 Inliner]: procedures = 775, calls = 2499, calls flagged for inlining = 69, calls inlined = 19, statements flattened = 1070 [2022-07-13 22:50:14,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:50:14,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:50:14,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:50:14,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:50:14,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14" (1/1) ... [2022-07-13 22:50:14,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14" (1/1) ... [2022-07-13 22:50:14,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14" (1/1) ... [2022-07-13 22:50:14,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14" (1/1) ... [2022-07-13 22:50:14,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14" (1/1) ... [2022-07-13 22:50:14,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14" (1/1) ... [2022-07-13 22:50:14,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14" (1/1) ... [2022-07-13 22:50:14,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:50:14,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:50:14,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:50:14,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:50:14,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14" (1/1) ... [2022-07-13 22:50:14,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:50:14,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:14,509 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) [2022-07-13 22:50:14,517 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 [2022-07-13 22:50:14,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-13 22:50:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:50:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:50:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:50:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-13 22:50:14,540 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-13 22:50:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:50:14,540 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:50:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-13 22:50:14,540 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-13 22:50:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:50:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:50:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:50:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:50:14,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:50:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:50:14,541 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:50:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-13 22:50:14,541 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-13 22:50:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:50:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-13 22:50:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-13 22:50:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:50:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:50:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:50:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:50:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2022-07-13 22:50:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2022-07-13 22:50:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-07-13 22:50:14,543 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-07-13 22:50:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-13 22:50:14,551 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-13 22:50:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2022-07-13 22:50:14,551 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2022-07-13 22:50:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-07-13 22:50:14,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-07-13 22:50:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:50:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-13 22:50:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-13 22:50:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-13 22:50:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-13 22:50:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-13 22:50:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-07-13 22:50:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-07-13 22:50:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2022-07-13 22:50:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2022-07-13 22:50:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2022-07-13 22:50:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2022-07-13 22:50:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:50:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:50:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-13 22:50:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-13 22:50:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:50:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-13 22:50:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-13 22:50:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-13 22:50:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-13 22:50:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-13 22:50:14,553 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-13 22:50:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_entry [2022-07-13 22:50:14,553 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_entry [2022-07-13 22:50:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2022-07-13 22:50:14,553 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2022-07-13 22:50:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2022-07-13 22:50:14,553 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2022-07-13 22:50:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 22:50:14,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 22:50:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:50:14,870 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:50:14,872 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:50:15,006 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !true; [2022-07-13 22:50:15,006 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-07-13 22:50:15,022 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2022-07-13 22:50:15,044 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2022-07-13 22:50:15,612 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !true; [2022-07-13 22:50:15,613 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !true; [2022-07-13 22:50:15,634 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:50:15,645 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:50:15,646 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-07-13 22:50:15,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:50:15 BoogieIcfgContainer [2022-07-13 22:50:15,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:50:15,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:50:15,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:50:15,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:50:15,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:50:11" (1/3) ... [2022-07-13 22:50:15,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b38a3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:50:15, skipping insertion in model container [2022-07-13 22:50:15,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:14" (2/3) ... [2022-07-13 22:50:15,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b38a3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:50:15, skipping insertion in model container [2022-07-13 22:50:15,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:50:15" (3/3) ... [2022-07-13 22:50:15,657 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_remove_harness.i [2022-07-13 22:50:15,670 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:50:15,670 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:50:15,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:50:15,739 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ec60088, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c5abff1 [2022-07-13 22:50:15,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:50:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 315 states, 205 states have (on average 1.248780487804878) internal successors, (256), 200 states have internal predecessors, (256), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2022-07-13 22:50:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-13 22:50:15,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:15,763 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:15,763 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1499271925, now seen corresponding path program 1 times [2022-07-13 22:50:15,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:15,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446972734] [2022-07-13 22:50:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:15,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:16,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:16,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:16,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:16,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:16,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:16,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446972734] [2022-07-13 22:50:16,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-13 22:50:16,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912892454] [2022-07-13 22:50:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:16,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:16,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:16,347 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) [2022-07-13 22:50:16,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 22:50:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:16,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 2903 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 22:50:16,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-07-13 22:50:16,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:16,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912892454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:16,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:16,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:50:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129008348] [2022-07-13 22:50:16,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:16,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:50:16,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:50:16,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:50:16,985 INFO L87 Difference]: Start difference. First operand has 315 states, 205 states have (on average 1.248780487804878) internal successors, (256), 200 states have internal predecessors, (256), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-13 22:50:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:17,026 INFO L93 Difference]: Finished difference Result 624 states and 904 transitions. [2022-07-13 22:50:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:50:17,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 184 [2022-07-13 22:50:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:17,036 INFO L225 Difference]: With dead ends: 624 [2022-07-13 22:50:17,036 INFO L226 Difference]: Without dead ends: 307 [2022-07-13 22:50:17,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:50:17,044 INFO L413 NwaCegarLoop]: 415 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, 415 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 [2022-07-13 22:50:17,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:50:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-07-13 22:50:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-07-13 22:50:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 192 states have (on average 1.21875) internal successors, (234), 194 states have internal predecessors, (234), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-13 22:50:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 406 transitions. [2022-07-13 22:50:17,111 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 406 transitions. Word has length 184 [2022-07-13 22:50:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:17,112 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 406 transitions. [2022-07-13 22:50:17,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-13 22:50:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 406 transitions. [2022-07-13 22:50:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-13 22:50:17,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:17,116 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:17,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 22:50:17,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-13 22:50:17,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1512102767, now seen corresponding path program 1 times [2022-07-13 22:50:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:17,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995021558] [2022-07-13 22:50:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:17,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:17,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 22:50:17,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901414590] [2022-07-13 22:50:17,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:17,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:17,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:17,472 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) [2022-07-13 22:50:17,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:50:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:18,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 2903 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:50:18,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-07-13 22:50:18,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:18,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995021558] [2022-07-13 22:50:18,247 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 22:50:18,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901414590] [2022-07-13 22:50:18,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901414590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:18,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:18,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:50:18,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246319372] [2022-07-13 22:50:18,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:18,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:50:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:18,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:50:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:50:18,249 INFO L87 Difference]: Start difference. First operand 307 states and 406 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-13 22:50:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:18,496 INFO L93 Difference]: Finished difference Result 565 states and 758 transitions. [2022-07-13 22:50:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:50:18,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 184 [2022-07-13 22:50:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:18,501 INFO L225 Difference]: With dead ends: 565 [2022-07-13 22:50:18,501 INFO L226 Difference]: Without dead ends: 314 [2022-07-13 22:50:18,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:50:18,503 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 436 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:18,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 985 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:50:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-07-13 22:50:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2022-07-13 22:50:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 197 states have (on average 1.218274111675127) internal successors, (240), 200 states have internal predecessors, (240), 88 states have call successors, (88), 27 states have call predecessors, (88), 28 states have return successors, (89), 86 states have call predecessors, (89), 86 states have call successors, (89) [2022-07-13 22:50:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 417 transitions. [2022-07-13 22:50:18,522 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 417 transitions. Word has length 184 [2022-07-13 22:50:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:18,522 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 417 transitions. [2022-07-13 22:50:18,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-13 22:50:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 417 transitions. [2022-07-13 22:50:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-13 22:50:18,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:18,525 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:18,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:18,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-13 22:50:18,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:18,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:18,747 INFO L85 PathProgramCache]: Analyzing trace with hash -312879987, now seen corresponding path program 1 times [2022-07-13 22:50:18,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:18,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80607042] [2022-07-13 22:50:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:18,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 22:50:18,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766256360] [2022-07-13 22:50:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:18,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:18,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:18,821 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) [2022-07-13 22:50:18,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:50:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:19,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 2913 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:50:19,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2022-07-13 22:50:19,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:19,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:19,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80607042] [2022-07-13 22:50:19,513 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 22:50:19,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766256360] [2022-07-13 22:50:19,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766256360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:19,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:19,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:50:19,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955548798] [2022-07-13 22:50:19,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:19,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:50:19,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:19,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:50:19,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:50:19,515 INFO L87 Difference]: Start difference. First operand 314 states and 417 transitions. Second operand has 7 states, 6 states have (on average 12.5) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-13 22:50:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:19,758 INFO L93 Difference]: Finished difference Result 534 states and 713 transitions. [2022-07-13 22:50:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:50:19,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.5) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 184 [2022-07-13 22:50:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:19,760 INFO L225 Difference]: With dead ends: 534 [2022-07-13 22:50:19,760 INFO L226 Difference]: Without dead ends: 307 [2022-07-13 22:50:19,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:50:19,762 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 456 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:19,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1295 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:50:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-07-13 22:50:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-07-13 22:50:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 192 states have (on average 1.2135416666666667) internal successors, (233), 194 states have internal predecessors, (233), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-13 22:50:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 405 transitions. [2022-07-13 22:50:19,781 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 405 transitions. Word has length 184 [2022-07-13 22:50:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:19,781 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 405 transitions. [2022-07-13 22:50:19,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.5) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-13 22:50:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 405 transitions. [2022-07-13 22:50:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-13 22:50:19,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:19,784 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:19,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:20,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:20,005 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash -561026481, now seen corresponding path program 1 times [2022-07-13 22:50:20,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:20,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569070173] [2022-07-13 22:50:20,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:20,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:20,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 22:50:20,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082072774] [2022-07-13 22:50:20,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:20,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:20,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:20,077 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) [2022-07-13 22:50:20,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:50:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:20,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 2918 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 22:50:20,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2022-07-13 22:50:20,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:20,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:20,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569070173] [2022-07-13 22:50:20,691 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 22:50:20,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082072774] [2022-07-13 22:50:20,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082072774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:20,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:20,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:50:20,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356296163] [2022-07-13 22:50:20,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:20,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:50:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:20,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:50:20,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:50:20,698 INFO L87 Difference]: Start difference. First operand 307 states and 405 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-13 22:50:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:20,728 INFO L93 Difference]: Finished difference Result 577 states and 765 transitions. [2022-07-13 22:50:20,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:50:20,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 184 [2022-07-13 22:50:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:20,733 INFO L225 Difference]: With dead ends: 577 [2022-07-13 22:50:20,733 INFO L226 Difference]: Without dead ends: 312 [2022-07-13 22:50:20,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:50:20,738 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 2 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:20,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1603 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:50:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-13 22:50:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-07-13 22:50:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 196 states have (on average 1.2091836734693877) internal successors, (237), 198 states have internal predecessors, (237), 87 states have call successors, (87), 27 states have call predecessors, (87), 28 states have return successors, (86), 86 states have call predecessors, (86), 85 states have call successors, (86) [2022-07-13 22:50:20,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 410 transitions. [2022-07-13 22:50:20,775 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 410 transitions. Word has length 184 [2022-07-13 22:50:20,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:20,776 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 410 transitions. [2022-07-13 22:50:20,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-13 22:50:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 410 transitions. [2022-07-13 22:50:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-13 22:50:20,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:20,778 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:20,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:20,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:21,000 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:21,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:21,000 INFO L85 PathProgramCache]: Analyzing trace with hash -673043207, now seen corresponding path program 1 times [2022-07-13 22:50:21,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:21,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474272559] [2022-07-13 22:50:21,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:21,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:50:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:50:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:50:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:50:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:50:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:50:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:50:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:50:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 22:50:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-13 22:50:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 22:50:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 22:50:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 22:50:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 22:50:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 22:50:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-07-13 22:50:21,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:21,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474272559] [2022-07-13 22:50:21,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474272559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:21,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098451131] [2022-07-13 22:50:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:21,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:21,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:21,599 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) [2022-07-13 22:50:21,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:50:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 2922 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 22:50:22,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:22,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:50:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-07-13 22:50:22,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:22,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098451131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:22,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:50:22,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 21 [2022-07-13 22:50:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879394320] [2022-07-13 22:50:22,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:22,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:50:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:22,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:50:22,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:50:22,470 INFO L87 Difference]: Start difference. First operand 312 states and 410 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 9 states have internal predecessors, (81), 4 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2022-07-13 22:50:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:22,622 INFO L93 Difference]: Finished difference Result 570 states and 755 transitions. [2022-07-13 22:50:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:50:22,622 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 9 states have internal predecessors, (81), 4 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 190 [2022-07-13 22:50:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:22,625 INFO L225 Difference]: With dead ends: 570 [2022-07-13 22:50:22,626 INFO L226 Difference]: Without dead ends: 316 [2022-07-13 22:50:22,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:50:22,627 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 65 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:22,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1489 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2022-07-13 22:50:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-07-13 22:50:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-07-13 22:50:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 200 states have (on average 1.205) internal successors, (241), 201 states have internal predecessors, (241), 87 states have call successors, (87), 28 states have call predecessors, (87), 28 states have return successors, (86), 86 states have call predecessors, (86), 85 states have call successors, (86) [2022-07-13 22:50:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 414 transitions. [2022-07-13 22:50:22,642 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 414 transitions. Word has length 190 [2022-07-13 22:50:22,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:22,642 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 414 transitions. [2022-07-13 22:50:22,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 9 states have internal predecessors, (81), 4 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2022-07-13 22:50:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 414 transitions. [2022-07-13 22:50:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-13 22:50:22,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:22,644 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:22,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:22,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:22,863 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:22,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:22,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1638806615, now seen corresponding path program 1 times [2022-07-13 22:50:22,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:22,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753122870] [2022-07-13 22:50:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:22,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:50:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:50:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:50:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:50:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 22:50:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:50:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 22:50:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:50:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 22:50:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 22:50:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 22:50:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 22:50:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 22:50:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 22:50:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 22:50:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 22:50:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2022-07-13 22:50:23,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:23,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753122870] [2022-07-13 22:50:23,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753122870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:23,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655276720] [2022-07-13 22:50:23,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:23,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:23,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:23,356 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) [2022-07-13 22:50:23,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 22:50:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:23,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 2946 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 22:50:23,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:24,785 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-07-13 22:50:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-07-13 22:50:30,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:30,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655276720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:30,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:50:30,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-07-13 22:50:30,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024480726] [2022-07-13 22:50:30,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:30,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:50:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:30,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:50:30,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-07-13 22:50:30,682 INFO L87 Difference]: Start difference. First operand 316 states and 414 transitions. Second operand has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-13 22:50:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:30,880 INFO L93 Difference]: Finished difference Result 572 states and 763 transitions. [2022-07-13 22:50:30,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:50:30,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) Word has length 196 [2022-07-13 22:50:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:30,883 INFO L225 Difference]: With dead ends: 572 [2022-07-13 22:50:30,883 INFO L226 Difference]: Without dead ends: 319 [2022-07-13 22:50:30,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2022-07-13 22:50:30,884 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 5 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 561 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:30,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2182 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 561 Unchecked, 0.1s Time] [2022-07-13 22:50:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-13 22:50:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 318. [2022-07-13 22:50:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 202 states have (on average 1.202970297029703) internal successors, (243), 202 states have internal predecessors, (243), 87 states have call successors, (87), 29 states have call predecessors, (87), 28 states have return successors, (86), 86 states have call predecessors, (86), 85 states have call successors, (86) [2022-07-13 22:50:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 416 transitions. [2022-07-13 22:50:30,894 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 416 transitions. Word has length 196 [2022-07-13 22:50:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:30,894 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 416 transitions. [2022-07-13 22:50:30,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-13 22:50:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 416 transitions. [2022-07-13 22:50:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-13 22:50:30,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:30,896 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:30,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 22:50:31,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:31,115 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:31,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1031269532, now seen corresponding path program 1 times [2022-07-13 22:50:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:31,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743190893] [2022-07-13 22:50:31,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:50:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 22:50:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 22:50:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 22:50:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 22:50:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 22:50:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 22:50:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 22:50:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 22:50:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-13 22:50:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2022-07-13 22:50:31,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:31,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743190893] [2022-07-13 22:50:31,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743190893] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:31,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:31,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:50:31,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139949577] [2022-07-13 22:50:31,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:31,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:50:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:31,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:50:31,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:50:31,690 INFO L87 Difference]: Start difference. First operand 318 states and 416 transitions. Second operand has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-13 22:50:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:32,820 INFO L93 Difference]: Finished difference Result 539 states and 714 transitions. [2022-07-13 22:50:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:50:32,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 201 [2022-07-13 22:50:32,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:32,822 INFO L225 Difference]: With dead ends: 539 [2022-07-13 22:50:32,823 INFO L226 Difference]: Without dead ends: 332 [2022-07-13 22:50:32,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:50:32,824 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 299 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:32,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 990 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 22:50:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-13 22:50:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2022-07-13 22:50:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 203 states have (on average 1.2019704433497538) internal successors, (244), 204 states have internal predecessors, (244), 87 states have call successors, (87), 29 states have call predecessors, (87), 29 states have return successors, (92), 86 states have call predecessors, (92), 85 states have call successors, (92) [2022-07-13 22:50:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 423 transitions. [2022-07-13 22:50:32,839 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 423 transitions. Word has length 201 [2022-07-13 22:50:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:32,841 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 423 transitions. [2022-07-13 22:50:32,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-13 22:50:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2022-07-13 22:50:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-13 22:50:32,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:32,844 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:32,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:50:32,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:32,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:32,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1674168939, now seen corresponding path program 1 times [2022-07-13 22:50:32,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:32,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684662542] [2022-07-13 22:50:32,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:32,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:50:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 22:50:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 22:50:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 22:50:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 22:50:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 22:50:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 22:50:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 22:50:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 22:50:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-13 22:50:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2022-07-13 22:50:33,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:33,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684662542] [2022-07-13 22:50:33,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684662542] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:33,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957400039] [2022-07-13 22:50:33,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:33,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:33,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:33,551 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) [2022-07-13 22:50:33,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 22:50:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:34,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 3006 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-13 22:50:34,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-07-13 22:50:34,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:50:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2022-07-13 22:50:34,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957400039] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:34,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:50:34,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17, 8] total 25 [2022-07-13 22:50:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871115013] [2022-07-13 22:50:34,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:34,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:50:34,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:34,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:50:34,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2022-07-13 22:50:34,506 INFO L87 Difference]: Start difference. First operand 320 states and 423 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2022-07-13 22:50:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:34,560 INFO L93 Difference]: Finished difference Result 328 states and 430 transitions. [2022-07-13 22:50:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:50:34,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2022-07-13 22:50:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:34,563 INFO L225 Difference]: With dead ends: 328 [2022-07-13 22:50:34,563 INFO L226 Difference]: Without dead ends: 326 [2022-07-13 22:50:34,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:50:34,564 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 13 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:34,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1584 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:50:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-13 22:50:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2022-07-13 22:50:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 206 states have (on average 1.1990291262135921) internal successors, (247), 207 states have internal predecessors, (247), 87 states have call successors, (87), 30 states have call predecessors, (87), 30 states have return successors, (92), 86 states have call predecessors, (92), 85 states have call successors, (92) [2022-07-13 22:50:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 426 transitions. [2022-07-13 22:50:34,579 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 426 transitions. Word has length 206 [2022-07-13 22:50:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:34,581 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 426 transitions. [2022-07-13 22:50:34,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2022-07-13 22:50:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 426 transitions. [2022-07-13 22:50:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-07-13 22:50:34,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:34,583 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:34,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:34,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:34,805 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:34,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash 799406762, now seen corresponding path program 1 times [2022-07-13 22:50:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:34,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265188939] [2022-07-13 22:50:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:50:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 22:50:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 22:50:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 22:50:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 22:50:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 22:50:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 22:50:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 22:50:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 22:50:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-13 22:50:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-13 22:50:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-13 22:50:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2022-07-13 22:50:35,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:35,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265188939] [2022-07-13 22:50:35,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265188939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:35,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466183613] [2022-07-13 22:50:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:35,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:35,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:35,480 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:50:35,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 22:50:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:36,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 3037 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 22:50:36,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-07-13 22:50:36,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:50:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2022-07-13 22:50:36,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466183613] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:36,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:50:36,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17, 8] total 25 [2022-07-13 22:50:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537581078] [2022-07-13 22:50:36,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:36,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:50:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:36,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:50:36,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2022-07-13 22:50:36,476 INFO L87 Difference]: Start difference. First operand 324 states and 426 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2022-07-13 22:50:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:36,528 INFO L93 Difference]: Finished difference Result 332 states and 433 transitions. [2022-07-13 22:50:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:50:36,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2022-07-13 22:50:36,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:36,532 INFO L225 Difference]: With dead ends: 332 [2022-07-13 22:50:36,533 INFO L226 Difference]: Without dead ends: 330 [2022-07-13 22:50:36,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:50:36,535 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 6 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:36,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1595 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:50:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-13 22:50:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2022-07-13 22:50:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 209 states have (on average 1.1961722488038278) internal successors, (250), 210 states have internal predecessors, (250), 87 states have call successors, (87), 31 states have call predecessors, (87), 31 states have return successors, (92), 86 states have call predecessors, (92), 85 states have call successors, (92) [2022-07-13 22:50:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 429 transitions. [2022-07-13 22:50:36,549 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 429 transitions. Word has length 219 [2022-07-13 22:50:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:36,550 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 429 transitions. [2022-07-13 22:50:36,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2022-07-13 22:50:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 429 transitions. [2022-07-13 22:50:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-07-13 22:50:36,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:36,553 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:36,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:36,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-13 22:50:36,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:36,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:36,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1379382235, now seen corresponding path program 1 times [2022-07-13 22:50:36,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:36,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963552323] [2022-07-13 22:50:36,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:36,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:50:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 22:50:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 22:50:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 22:50:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 22:50:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 22:50:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 22:50:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 22:50:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 22:50:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-13 22:50:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-13 22:50:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2022-07-13 22:50:37,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:37,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963552323] [2022-07-13 22:50:37,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963552323] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:37,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813565786] [2022-07-13 22:50:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:37,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:37,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:37,572 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:50:37,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 22:50:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:38,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 3159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:50:38,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 21 proven. 250 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2022-07-13 22:50:38,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:50:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2022-07-13 22:50:38,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813565786] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:38,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:50:38,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18, 6] total 26 [2022-07-13 22:50:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909281656] [2022-07-13 22:50:38,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:38,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:50:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:38,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:50:38,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:50:38,774 INFO L87 Difference]: Start difference. First operand 328 states and 429 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 5 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (35), 5 states have call predecessors, (35), 5 states have call successors, (35) [2022-07-13 22:50:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:38,990 INFO L93 Difference]: Finished difference Result 569 states and 763 transitions. [2022-07-13 22:50:38,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:50:38,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 5 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (35), 5 states have call predecessors, (35), 5 states have call successors, (35) Word has length 227 [2022-07-13 22:50:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:38,993 INFO L225 Difference]: With dead ends: 569 [2022-07-13 22:50:38,994 INFO L226 Difference]: Without dead ends: 376 [2022-07-13 22:50:38,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-07-13 22:50:38,995 INFO L413 NwaCegarLoop]: 401 mSDtfsCounter, 486 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:38,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1506 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:50:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-13 22:50:39,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 338. [2022-07-13 22:50:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 214 states have (on average 1.191588785046729) internal successors, (255), 215 states have internal predecessors, (255), 92 states have call successors, (92), 31 states have call predecessors, (92), 31 states have return successors, (97), 91 states have call predecessors, (97), 90 states have call successors, (97) [2022-07-13 22:50:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 444 transitions. [2022-07-13 22:50:39,013 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 444 transitions. Word has length 227 [2022-07-13 22:50:39,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:39,014 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 444 transitions. [2022-07-13 22:50:39,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 5 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (35), 5 states have call predecessors, (35), 5 states have call successors, (35) [2022-07-13 22:50:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 444 transitions. [2022-07-13 22:50:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-07-13 22:50:39,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:39,017 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:39,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:39,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 22:50:39,240 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:39,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:39,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1598236953, now seen corresponding path program 1 times [2022-07-13 22:50:39,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:39,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905356907] [2022-07-13 22:50:39,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:39,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:50:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 22:50:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 22:50:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 22:50:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 22:50:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 22:50:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 22:50:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 22:50:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 22:50:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-13 22:50:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-13 22:50:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2022-07-13 22:50:40,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:40,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905356907] [2022-07-13 22:50:40,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905356907] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:40,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132238086] [2022-07-13 22:50:40,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:40,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:40,055 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:50:40,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 22:50:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:40,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 3152 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 22:50:40,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2022-07-13 22:50:40,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:40,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132238086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:40,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:50:40,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 20 [2022-07-13 22:50:40,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100510989] [2022-07-13 22:50:40,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:40,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:50:40,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:40,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:50:40,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:50:40,898 INFO L87 Difference]: Start difference. First operand 338 states and 444 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-13 22:50:40,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:40,943 INFO L93 Difference]: Finished difference Result 478 states and 625 transitions. [2022-07-13 22:50:40,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:50:40,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 227 [2022-07-13 22:50:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:40,946 INFO L225 Difference]: With dead ends: 478 [2022-07-13 22:50:40,946 INFO L226 Difference]: Without dead ends: 338 [2022-07-13 22:50:40,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:50:40,948 INFO L413 NwaCegarLoop]: 399 mSDtfsCounter, 32 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:40,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1165 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:50:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-13 22:50:40,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2022-07-13 22:50:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 214 states have (on average 1.1822429906542056) internal successors, (253), 215 states have internal predecessors, (253), 92 states have call successors, (92), 31 states have call predecessors, (92), 31 states have return successors, (97), 91 states have call predecessors, (97), 90 states have call successors, (97) [2022-07-13 22:50:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2022-07-13 22:50:40,964 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 227 [2022-07-13 22:50:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:40,964 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2022-07-13 22:50:40,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-13 22:50:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2022-07-13 22:50:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-07-13 22:50:40,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:40,966 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:40,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:41,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 22:50:41,191 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:41,191 INFO L85 PathProgramCache]: Analyzing trace with hash -395907753, now seen corresponding path program 1 times [2022-07-13 22:50:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:41,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805743712] [2022-07-13 22:50:41,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:41,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:50:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 22:50:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 22:50:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 22:50:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 22:50:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 22:50:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 22:50:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 22:50:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 22:50:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-13 22:50:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-13 22:50:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2022-07-13 22:50:41,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:41,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805743712] [2022-07-13 22:50:41,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805743712] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:41,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943387433] [2022-07-13 22:50:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:41,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:41,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:41,858 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:50:41,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 22:50:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:42,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 3139 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 22:50:42,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-13 22:50:42,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:42,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943387433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:42,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:50:42,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2022-07-13 22:50:42,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216873209] [2022-07-13 22:50:42,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:42,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:50:42,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:42,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:50:42,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:50:42,723 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-13 22:50:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:42,895 INFO L93 Difference]: Finished difference Result 586 states and 779 transitions. [2022-07-13 22:50:42,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:50:42,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 227 [2022-07-13 22:50:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:42,897 INFO L225 Difference]: With dead ends: 586 [2022-07-13 22:50:42,897 INFO L226 Difference]: Without dead ends: 343 [2022-07-13 22:50:42,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:50:42,899 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 3 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:42,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2205 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:50:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-13 22:50:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2022-07-13 22:50:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 216 states have (on average 1.1805555555555556) internal successors, (255), 218 states have internal predecessors, (255), 92 states have call successors, (92), 31 states have call predecessors, (92), 32 states have return successors, (102), 91 states have call predecessors, (102), 90 states have call successors, (102) [2022-07-13 22:50:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 449 transitions. [2022-07-13 22:50:42,916 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 449 transitions. Word has length 227 [2022-07-13 22:50:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:42,917 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 449 transitions. [2022-07-13 22:50:42,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-13 22:50:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 449 transitions. [2022-07-13 22:50:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-07-13 22:50:42,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:42,919 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:42,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:43,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 22:50:43,132 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:43,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash -886534644, now seen corresponding path program 1 times [2022-07-13 22:50:43,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:43,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169090476] [2022-07-13 22:50:43,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:43,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:50:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 22:50:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 22:50:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 22:50:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 22:50:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 22:50:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 22:50:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-13 22:50:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-13 22:50:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-13 22:50:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-13 22:50:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2022-07-13 22:50:43,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:43,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169090476] [2022-07-13 22:50:43,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169090476] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:43,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263786630] [2022-07-13 22:50:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:43,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:43,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:43,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:50:43,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 22:50:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 3201 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 22:50:44,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2022-07-13 22:50:44,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:44,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263786630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:44,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:50:44,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2022-07-13 22:50:44,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571220742] [2022-07-13 22:50:44,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:44,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:50:44,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:44,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:50:44,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:50:44,563 INFO L87 Difference]: Start difference. First operand 341 states and 449 transitions. Second operand has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-13 22:50:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:44,726 INFO L93 Difference]: Finished difference Result 579 states and 766 transitions. [2022-07-13 22:50:44,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:50:44,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 238 [2022-07-13 22:50:44,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:44,728 INFO L225 Difference]: With dead ends: 579 [2022-07-13 22:50:44,728 INFO L226 Difference]: Without dead ends: 343 [2022-07-13 22:50:44,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:50:44,729 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 3 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:44,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2206 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:50:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-13 22:50:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2022-07-13 22:50:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 216 states have (on average 1.1805555555555556) internal successors, (255), 218 states have internal predecessors, (255), 92 states have call successors, (92), 31 states have call predecessors, (92), 32 states have return successors, (100), 91 states have call predecessors, (100), 90 states have call successors, (100) [2022-07-13 22:50:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 447 transitions. [2022-07-13 22:50:44,748 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 447 transitions. Word has length 238 [2022-07-13 22:50:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:44,748 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 447 transitions. [2022-07-13 22:50:44,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-13 22:50:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 447 transitions. [2022-07-13 22:50:44,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-13 22:50:44,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:44,750 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:44,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:44,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 22:50:44,973 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash -448569881, now seen corresponding path program 2 times [2022-07-13 22:50:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:44,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062905488] [2022-07-13 22:50:44,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:44,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:50:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 22:50:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 22:50:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 22:50:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:46,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 22:50:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-13 22:50:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-13 22:50:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-13 22:50:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-13 22:50:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-13 22:50:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-13 22:50:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-07-13 22:50:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:47,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062905488] [2022-07-13 22:50:47,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062905488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:47,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221440719] [2022-07-13 22:50:47,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:50:47,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:47,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:47,661 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:50:47,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 22:50:48,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:50:48,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:50:48,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 3247 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 22:50:48,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2022-07-13 22:50:48,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:48,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221440719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:48,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:50:48,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [43] total 47 [2022-07-13 22:50:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331342287] [2022-07-13 22:50:48,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:48,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:50:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:48,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:50:48,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2030, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 22:50:48,638 INFO L87 Difference]: Start difference. First operand 341 states and 447 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-13 22:50:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:48,807 INFO L93 Difference]: Finished difference Result 637 states and 840 transitions. [2022-07-13 22:50:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:50:48,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 249 [2022-07-13 22:50:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:48,809 INFO L225 Difference]: With dead ends: 637 [2022-07-13 22:50:48,809 INFO L226 Difference]: Without dead ends: 343 [2022-07-13 22:50:48,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 320 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2022-07-13 22:50:48,811 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 3 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:48,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1825 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:50:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-13 22:50:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 336. [2022-07-13 22:50:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 212 states have (on average 1.1745283018867925) internal successors, (249), 214 states have internal predecessors, (249), 92 states have call successors, (92), 31 states have call predecessors, (92), 31 states have return successors, (99), 90 states have call predecessors, (99), 90 states have call successors, (99) [2022-07-13 22:50:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 440 transitions. [2022-07-13 22:50:48,825 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 440 transitions. Word has length 249 [2022-07-13 22:50:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:48,825 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 440 transitions. [2022-07-13 22:50:48,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-13 22:50:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 440 transitions. [2022-07-13 22:50:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-07-13 22:50:48,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:48,827 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:48,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:49,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 22:50:49,044 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash 495547672, now seen corresponding path program 1 times [2022-07-13 22:50:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:49,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255439035] [2022-07-13 22:50:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:49,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:49,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 22:50:49,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482131837] [2022-07-13 22:50:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:49,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:49,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:49,112 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:50:49,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 22:50:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:50,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 3360 conjuncts, 339 conjunts are in the unsatisfiable core [2022-07-13 22:50:50,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:50,372 INFO L390 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 [2022-07-13 22:50:50,555 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 22:50:50,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 22:50:50,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:50:50,926 INFO L356 Elim1Store]: treesize reduction 173, result has 26.4 percent of original size [2022-07-13 22:50:50,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 93 treesize of output 134 [2022-07-13 22:50:51,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:50:51,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:50:51,094 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 22:50:51,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2022-07-13 22:50:51,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:50:51,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:50:51,158 INFO L356 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-07-13 22:50:51,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 37 [2022-07-13 22:50:51,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:50:51,657 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 22:50:51,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-13 22:50:51,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:50:51,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-13 22:50:51,918 INFO L356 Elim1Store]: treesize reduction 102, result has 17.1 percent of original size [2022-07-13 22:50:51,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:51,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255439035] [2022-07-13 22:50:51,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 22:50:51,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482131837] [2022-07-13 22:50:51,919 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 22:50:51,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-13 22:50:52,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:52,120 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_134| input size 114 context size 114 output size 114 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 22:50:52,124 INFO L158 Benchmark]: Toolchain (without parser) took 40279.21ms. Allocated memory was 130.0MB in the beginning and 729.8MB in the end (delta: 599.8MB). Free memory was 89.7MB in the beginning and 412.2MB in the end (delta: -322.5MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. [2022-07-13 22:50:52,124 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:50:52,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2376.57ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 89.7MB in the beginning and 115.3MB in the end (delta: -25.6MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2022-07-13 22:50:52,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 155.52ms. Allocated memory is still 169.9MB. Free memory was 115.3MB in the beginning and 101.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 22:50:52,124 INFO L158 Benchmark]: Boogie Preprocessor took 96.50ms. Allocated memory is still 169.9MB. Free memory was 101.7MB in the beginning and 92.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 22:50:52,124 INFO L158 Benchmark]: RCFGBuilder took 1171.62ms. Allocated memory was 169.9MB in the beginning and 264.2MB in the end (delta: 94.4MB). Free memory was 92.2MB in the beginning and 164.8MB in the end (delta: -72.6MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2022-07-13 22:50:52,125 INFO L158 Benchmark]: TraceAbstraction took 36472.20ms. Allocated memory was 264.2MB in the beginning and 729.8MB in the end (delta: 465.6MB). Free memory was 164.8MB in the beginning and 412.2MB in the end (delta: -247.4MB). Peak memory consumption was 217.7MB. Max. memory is 16.1GB. [2022-07-13 22:50:52,126 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.14ms. Allocated memory is still 92.3MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2376.57ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 89.7MB in the beginning and 115.3MB in the end (delta: -25.6MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 155.52ms. Allocated memory is still 169.9MB. Free memory was 115.3MB in the beginning and 101.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.50ms. Allocated memory is still 169.9MB. Free memory was 101.7MB in the beginning and 92.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1171.62ms. Allocated memory was 169.9MB in the beginning and 264.2MB in the end (delta: 94.4MB). Free memory was 92.2MB in the beginning and 164.8MB in the end (delta: -72.6MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 36472.20ms. Allocated memory was 264.2MB in the beginning and 729.8MB in the end (delta: 465.6MB). Free memory was 164.8MB in the beginning and 412.2MB in the end (delta: -247.4MB). Peak memory consumption was 217.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_134| input size 114 context size 114 output size 114 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_134| input size 114 context size 114 output size 114: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 22:50:52,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_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 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:50:53,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:50:53,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:50:53,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:50:53,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:50:53,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:50:53,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:50:53,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:50:53,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:50:53,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:50:53,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:50:53,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:50:53,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:50:53,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:50:53,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:50:53,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:50:53,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:50:53,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:50:53,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:50:53,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:50:53,896 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:50:53,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:50:53,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:50:53,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:50:53,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:50:53,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:50:53,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:50:53,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:50:53,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:50:53,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:50:53,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:50:53,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:50:53,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:50:53,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:50:53,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:50:53,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:50:53,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:50:53,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:50:53,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:50:53,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:50:53,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:50:53,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:50:53,919 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-13 22:50:53,945 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:50:53,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:50:53,946 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:50:53,946 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:50:53,946 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:50:53,947 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:50:53,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:50:53,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:50:53,948 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:50:53,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:50:53,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:50:53,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:50:53,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:50:53,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:50:53,950 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 22:50:53,950 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 22:50:53,950 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 22:50:53,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:50:53,950 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:50:53,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:50:53,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:50:53,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:50:53,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:50:53,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:50:53,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:50:53,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:50:53,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:50:53,952 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 22:50:53,952 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 22:50:53,952 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:50:53,953 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:50:53,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:50:53,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 22:50:53,953 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 -> 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 [2022-07-13 22:50:54,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:50:54,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:50:54,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:50:54,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:50:54,227 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:50:54,228 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2022-07-13 22:50:54,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c7852ac/2dcaabddd98f41b29fe0fc08a104434b/FLAG70e6e2fec [2022-07-13 22:50:54,869 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:50:54,869 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2022-07-13 22:50:54,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c7852ac/2dcaabddd98f41b29fe0fc08a104434b/FLAG70e6e2fec [2022-07-13 22:50:55,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c7852ac/2dcaabddd98f41b29fe0fc08a104434b [2022-07-13 22:50:55,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:50:55,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:50:55,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:50:55,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:50:55,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:50:55,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:50:55" (1/1) ... [2022-07-13 22:50:55,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f56035d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:50:55, skipping insertion in model container [2022-07-13 22:50:55,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:50:55" (1/1) ... [2022-07-13 22:50:55,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:50:55,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:50:55,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4495,4508] [2022-07-13 22:50:55,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4555,4568] [2022-07-13 22:50:55,964 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,965 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,965 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,966 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,967 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,975 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,977 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,979 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,980 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,982 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,984 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,985 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:55,986 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:50:56,232 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:50:56,233 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:50:56,235 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:50:56,237 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:50:56,237 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:50:56,238 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:50:56,239 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:50:56,246 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:50:56,247 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:50:56,249 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:50:56,355 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:50:56,364 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1454) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1397) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 22:50:56,372 INFO L158 Benchmark]: Toolchain (without parser) took 1320.79ms. Allocated memory was 50.3MB in the beginning and 71.3MB in the end (delta: 21.0MB). Free memory was 26.7MB in the beginning and 30.1MB in the end (delta: -3.4MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2022-07-13 22:50:56,373 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.0MB in the beginning and 32.0MB in the end (delta: 31.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:50:56,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1317.96ms. Allocated memory was 50.3MB in the beginning and 71.3MB in the end (delta: 21.0MB). Free memory was 26.5MB in the beginning and 30.1MB in the end (delta: -3.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2022-07-13 22:50:56,376 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.0MB in the beginning and 32.0MB in the end (delta: 31.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1317.96ms. Allocated memory was 50.3MB in the beginning and 71.3MB in the end (delta: 21.0MB). Free memory was 26.5MB in the beginning and 30.1MB in the end (delta: -3.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range